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

public int maxDepth(Node root) {

if(root == null){

return 0;

}

if(root.children == null || root.children.isEmpty()){

return 1;

}

int max = Integer.MIN_VALUE;

for(Node child : root.children){

max = Math.max(maxDepth(child), max);

}

return 1 + max;

}