About call stack

When a recursive function enters the base case without any recursive calls, will the call stack be empty?

Why or why not?

My thinking is no. Because the call stack will be one before it is empty. Any other idea?

1 Like

The call stack will contain the original call to the function

myFcn(17) {
    if n > 16
        ....
    else
         myFcn(n-1)
}
```
The call stack will have myFcn(17) in it
1 Like