|
| 1 | +<h2><a href="https://leetcode.com/problems/n-ary-tree-postorder-traversal">590. N-ary Tree Postorder Traversal</a></h2><h3>Easy</h3><hr><p>Given the <code>root</code> of an n-ary tree, return <em>the postorder traversal of its nodes' values</em>.</p> |
| 2 | + |
| 3 | +<p>Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)</p> |
| 4 | + |
| 5 | +<p> </p> |
| 6 | +<p><strong class="example">Example 1:</strong></p> |
| 7 | +<img src="https://assets.leetcode.com/uploads/2018/10/12/narytreeexample.png" style="width: 100%; max-width: 300px;" /> |
| 8 | +<pre> |
| 9 | +<strong>Input:</strong> root = [1,null,3,2,4,null,5,6] |
| 10 | +<strong>Output:</strong> [5,6,3,2,4,1] |
| 11 | +</pre> |
| 12 | + |
| 13 | +<p><strong class="example">Example 2:</strong></p> |
| 14 | +<img alt="" src="https://assets.leetcode.com/uploads/2019/11/08/sample_4_964.png" style="width: 296px; height: 241px;" /> |
| 15 | +<pre> |
| 16 | +<strong>Input:</strong> root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14] |
| 17 | +<strong>Output:</strong> [2,6,14,11,7,3,12,8,4,13,9,10,5,1] |
| 18 | +</pre> |
| 19 | + |
| 20 | +<p> </p> |
| 21 | +<p><strong>Constraints:</strong></p> |
| 22 | + |
| 23 | +<ul> |
| 24 | + <li>The number of nodes in the tree is in the range <code>[0, 10<sup>4</sup>]</code>.</li> |
| 25 | + <li><code>0 <= Node.val <= 10<sup>4</sup></code></li> |
| 26 | + <li>The height of the n-ary tree is less than or equal to <code>1000</code>.</li> |
| 27 | +</ul> |
| 28 | + |
| 29 | +<p> </p> |
| 30 | +<p><strong>Follow up:</strong> Recursive solution is trivial, could you do it iteratively?</p> |
0 commit comments