> For the complete documentation index, see [llms.txt](https://aaronice.gitbook.io/lintcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://aaronice.gitbook.io/lintcode/trees/n-ary-tree-postorder-traversal.md).

# N-ary Tree Postorder Traversal

`Tree`

**Easy**

Given an n-ary tree, return thepostordertraversal of its nodes' values.

For example, given a`3-ary`tree:

![](https://assets.leetcode.com/uploads/2018/10/12/narytreeexample.png)

Return its postorder traversal as:`[5,6,3,2,4,1]`.

**Note:**

Recursive solution is trivial, could you do it iteratively?

## Solution

### Iterative - with stack

```java
/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val,List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/
class Solution {
    public List<Integer> postorder(Node root) {
        LinkedList<Integer> res = new LinkedList<>();
        if (root == null) {
            return res;
        }
        LinkedList<Node> stack = new LinkedList<>();
        stack.push(root);

        while (!stack.isEmpty()) {
            Node node = stack.pop();
            res.addFirst(node.val);

            if (node.children != null) {
                for (Node c: node.children) {
                    if (c != null) {
                        stack.push(c);
                    }
                }
            }
        }

        return res;
    }
}
```

**Complexity Analysis**

* Time complexity : we visit each node exactly once, thus the time complexity is O(N), where N is the number of nodes, \_i.e.\_ the size of tree.
* Space complexity : depending on the tree structure, we could keep up to the entire tree, therefore, the space complexity is O(N).

### Recursive

```java
class Solution {
    public List<Integer> postorder(Node root) {
        LinkedList<Integer> res = new LinkedList<>();
        if (root == null) {
            return res;
        }

        postorderHelper(root, res);

        return res;
    }

    private void postorderHelper(Node root, List<Integer> res) {
        if (root == null) {
            return;
        }
        if (root.children != null) {
            for (Node c : root.children) {
                postorderHelper(c, res);
            }
        }
        res.add(root.val);
    }
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://aaronice.gitbook.io/lintcode/trees/n-ary-tree-postorder-traversal.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.