maximum-depth-of-n-ary-tree

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a n-ary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

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: 3
</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: 5
</pre>

&nbsp;
Constraints:

<ul>
	<li>The total number of nodes is in the range <code>[0, 104]</code>.</li>
	<li>The depth of the n-ary tree is less than or equal to <code>1000</code>.</li>
</ul>

maxDepth

Maximum Depth of N-ary Tree

Maximum Depth of Binary Tree

maximum-depth-of-binary-tree

二叉树的最大深度

The Time When the Network Becomes Idle

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

网络空闲的时刻

Count the Number of Good Nodes

count-the-number-of-good-nodes

统计好节点的数目

Tree

Depth-First Search

Breadth-First Search

给定一个 N 叉树，找到其最大深度。

最大深度是指从根节点到最远叶子节点的最长路径上的节点总数。

N 叉树输入按层序遍历序列化表示，每组子节点由空值分隔（请参见示例）。

 

示例 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]
输出：3
</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]
输出：5
</pre>

 

提示：

<ul>
	<li>树的深度不会超过 <code>1000</code> 。</li>
	<li>树的节点数目位于 <code>[0, 104]</code> 之间。</li>
</ul>