Tree Zig Zag Hints How do you traverse a tree such that you visit all of a vertex's neighbors before visiting its neighbors' neighbors? How do you keep track of whether to print out the left-most or right-most vertex?