Let’s say I have a tree structure and I’m starting at the root and I want to travel down each path to its final node. I get that a recursive function makes sense to do this, but how do you make sure that after you traverse a path and then back up a level or more to traverse another path, that you aren’t revisiting a previous path. Wouldn’t you need to keep track of where you have been already so you don’t re-visit the same path? Can someone help me understand how this works? Thanks!