# N-ary Tree Traversal (4 Qs)

{% hint style="info" %}
We could solve these problems **iteratively** using the same technique, **Stack/Queue**.
{% endhint %}

{% hint style="warning" %}
For **solving postorder traversal iteratively**, we need to store extra information **"Visited Status".**

**For level order,** we need to use **Queue** instead of Stack.
{% endhint %}

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

* [0589. N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/)
* [0590. N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/)
* [0429. N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/)
  * [0559. Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/)