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).
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
模板还是好，用for循环代替left= right=就行了
参考：https://leetcode.com/problems/maximum-depth-of-n-ary-tree/discuss/152659/Java-solution-with-explain-same-logic-with-Maximum-Depth-of-binary-tree
class Solution {
public int maxDepth(Node root) {
if (root == null) {
return 0;
}
int max = 0;
for (Node child : root.children) { //replace left&right to for loop
int value = maxDepth(child);
if (value > max) {
max = value;
}
}
return max +1;
}
}