Ace Test Series: Algorithms - Graph Algorithms

Question

Answer 1

(b) $6$

You can achieve the maximum depth of 6 recursive calls when you have following elements on the stack :

$0,1,2,3,4,6$

($6$ being the element on the top and $0$ being the element at the bottom.)

Once you reach this state, you have to start popping the elements from the stack.

You can find a similar, but better question here.

Comments

Why 5 will not be covered ?

---

5 will be covered in subsequent recursive calls. What I have mentioned is the stack trace at the deepest recursive call.