How do I trace recursive functions like these that calls itself recursively two times? I wanted to create a tree of the calls. When I stumbled into this, how do I know which of the methods that currently are being executed? CountWays(numStairs-1) or CountWays(numStairs-2)

When I stumbled into this, how do I know wich of the methods that currently are being executed?Why do you want to do that at all? Are you trying to understand how it works? What are you trying to accomplish?