Recursion Stack

Question

My doubt is, In the stack, we will push [main()->PTN(3)->PTN(2)->PTN(1)->PTN(0)]       PTN = printTwoNumbers function call

Then according to answer PTN(0) won't pushed into stack, but at least to check if and return we should push it. What's the correct.

My answer is 5, given is 4

Comments

5 looks corrrect. PTN(0) will be pushed.

---

Thanks @Anu Sir

---

#include <stdlib.h>
#include <stdio.h>

void check(int depth) {
    char c;
    char *ptr = malloc(1);
    printf("stack at %p, heap at %p\n", &c, ptr);
    if (depth == 0) return;
    check(depth-1);
}

int main() {
    check(3);
    return 0;
}

On my machine I see:

So , 4 is the ans.

---

But why i didn't pushed for checking of 0?

---

Now try

#include <stdlib.h>
#include <stdio.h>

void check(int depth) {
    printf("\n%d\n",depth);
    if (depth == 0) return;
    check(depth-1);
}

int main() {
    printf("h");
    check(3);
    return 0;
}

Check : https://ideone.com/w0baKA 

---

output for this :321123 right?

---

what is  mean by  minimum size of stack to avoid stack overflow error?

---

@Balaji you are printing space allocated for function calls only, but before that one main() call is already present in the stack.

---

I think you didn't include main function.