Package g0401_0500.s0429_n_ary_tree_level_order_traversal

Class Solution

java.lang.Object

g0401_0500.s0429_n_ary_tree_level_order_traversal.Solution

public class Solution
extends Object

429 - N-ary Tree Level Order Traversal.<p>Medium</p> <p>Given an n-ary tree, return the <em>level order</em> traversal of its nodes&rsquo; values.</p> <p><em>Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).</em></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> [[1],[3,2,4],[5,6]]</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> [[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]</p> <p><strong>Constraints:</strong></p> <ul> <li>The height of the n-ary tree is less than or equal to <code>1000</code></li> <li>The total number of nodes is between <code>[0, 10⁴]</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<List<Integer>>	levelOrder(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

levelOrder

public List<List<Integer>> levelOrder(Node root)