Maximum Depth of an N-ary Tree
Find the maximum depth of an N-ary tree.
Input: root = [1,null,2,null,3,null,4]
Output: 4
Explanation: The tree is essentially a straight line, requiring a traversal that reaches a maximum depth of 4 layers.

Question

Find the maximum depth of an N-ary tree.

Input: root = [1,null,2,null,3,null,4]

Output: 4

Explanation: The tree is essentially a straight line, requiring a traversal that reaches a maximum depth of 4 layers.

Anonymous · Accepted Answer

int f(TreeNode root){

if(root==null)

return 0;

return find(root);

}

int find(TreeNode root){

if(root==null) return 0;

int h = 0;

for(TreeNode child: root.getChildren){

int temp = 1+find(child);

h = Math.max(h,temp);

}

return h;

}