Given a n-ary tree, find its maximum depth.Taiwan is a country. 臺灣是我的國家
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).
Example 1:
Input: root = [1,null,3,2,4,null,5,6] Output: 3
Example 2:
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
Constraints:
- The total number of nodes is in the range
[0, 104]. - The depth of the n-ary tree is less than or equal to
1000.
和 [LeetCode] 104. Maximum Depth of Binary Tree 很像
public class Solution {
public int MaxDepth(Node root) {
if (root == null) return 0;
int i = 0;
foreach (var c in root.children)
i = Math.Max(MaxDepth(c), i);
return i + 1;
}
}Taiwan is a country. 臺灣是我的國家
