n-ary-tree-level-order-traversal

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an n-ary tree, return the level order traversal of its nodes&#39; values.

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

&nbsp;
Example 1:

<img src="https://assets.leetcode.com/uploads/2018/10/12/narytreeexample.png" style="width: 100%; max-width: 300px;" />

<pre>
Input: root = [1,null,3,2,4,null,5,6]
Output: [[1],[3,2,4],[5,6]]
</pre>

Example 2:

<img alt="" src="https://assets.leetcode.com/uploads/2019/11/08/sample_4_964.png" style="width: 296px; height: 241px;" />

<pre>
Input: 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]
Output: [[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]
</pre>

&nbsp;
Constraints:

<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, 104]</code></li>
</ul>

levelOrder

N-ary Tree Level Order Traversal

Binary Tree Level Order Traversal

binary-tree-level-order-traversal

二叉树的层序遍历

N-ary Tree Preorder Traversal

n-ary-tree-preorder-traversal

N 叉树的前序遍历

N-ary Tree Postorder Traversal

n-ary-tree-postorder-traversal

N 叉树的后序遍历

The Time When the Network Becomes Idle

the-time-when-the-network-becomes-idle

网络空闲的时刻

Tree

Breadth-First Search

给定一个 N 叉树，返回其节点值的层序遍历。（即从左到右，逐层遍历）。

树的序列化输入是用层序遍历，每组子节点都由 null 值分隔（参见示例）。

&nbsp;

示例 1：

<img src="https://assets.leetcode.com/uploads/2018/10/12/narytreeexample.png" style="width: 100%; max-width: 300px;" />

<pre>
输入：root = [1,null,3,2,4,null,5,6]
输出：[[1],[3,2,4],[5,6]]
</pre>

示例 2：

<img alt="" src="https://assets.leetcode.com/uploads/2019/11/08/sample_4_964.png" style="width: 296px; height: 241px;" />

<pre>
输入：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]
输出：[[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]
</pre>

&nbsp;

提示：

<ul>
	<li>树的高度不会超过&nbsp;<code>1000</code></li>
	<li>树的节点总数在 <code>[0,&nbsp;104]</code> 之间</li>
</ul>