N-ary Tree Traversal (4 Qs)

Series of problems related to "N-ary Tree Traversal"

We could solve these problems iteratively using the same technique, Stack/Queue.

For solving postorder traversal iteratively, we need to store extra information "Visited Status".

For level order, we need to use Queue instead of Stack.

Related problems (follow the order to solve each problem):

• 0589. N-ary Tree Preorder Traversal

• 0590. N-ary Tree Postorder Traversal

• 0429. N-ary Tree Level Order Traversal

  • 0559. Maximum Depth of N-ary Tree