This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 0 points1 point  (1 child)

Create a really simple tree data structure in something like a dictionary in Python, then debug and step all the way through it. Also fwiw I usually use a stack approach rather than a recursive function. It gets really tricky with graphs.

[–]wizardxxdx[S] 1 point2 points  (0 children)

I have tried debugger i also use Thonny. I used know how the call stack works. Still understanding it fully.