# Leetcode 590 - N-ary Tree Postorder Traversal

Note:

• Because preorder adding order is node, left, right.
• If we make it node, right, left, then reverse the final res[]. Then it’s postOrder traversal.

Question:

Given the root of an n-ary tree, return the postorder traversal of its nodes’ values.

Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)

Example:

Code:

Iterative

Recursive