Package g0501_0600.s0590_n_ary_tree_postorder_traversal

Class Solution

java.lang.Object

g0501_0600.s0590_n_ary_tree_postorder_traversal.Solution

public class Solution
extends Object

590 - N-ary Tree Postorder Traversal.<p>Easy</p> <p>Given the <code>root</code> of an n-ary tree, return <em>the postorder traversal of its nodes&rsquo; values</em>.</p> <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> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2018/10/12/narytreeexample.png" alt="" /></p> <p><strong>Input:</strong> root = [1,null,3,2,4,null,5,6]</p> <p><strong>Output:</strong> [5,6,3,2,4,1]</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/11/08/sample_4_964.png" alt="" /></p> <p><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]</p> <p><strong>Output:</strong> [2,6,14,11,7,3,12,8,4,13,9,10,5,1]</p> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in the tree is in the range <code>[0, 10⁴]</code>.</li> <li><code>0 <= Node.val <= 10⁴</code></li> <li>The height of the n-ary tree is less than or equal to <code>1000</code>.</li> </ul> <p><strong>Follow up:</strong> Recursive solution is trivial, could you do it iteratively?</p>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<Integer>	postorder(Node root)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

postorder

public List<Integer> postorder(Node root)