LeetCode知识点总结 - 559

LeetCode 559. Maximum Depth of N-ary Tree

考点	难度
Tree	Easy

题目

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).

思路

对于每一个child（不止两个）计算height，选最大的return。

答案

public int maxDepth(Node root) {
        if(root == null) {
            return 0;
        }
        
        //already height is 1 if node is not null
        int height = 1;
        
        for(Node node : root.children) {
            
			//track max height.
            height = Math.max(height, 1+maxDepth(node)); 
        }
        
        return height;
}