559. Maximum Depth of N-ary Tree

Leetcode Tree

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.

For example, given a 3-ary tree:

We should return its max depth, which is 3.

Note:

• The depth of the tree is at most 1000.
• The total number of nodes is at most 5000.

分析

这道题目和104. Maximum Depth of Binary Tree非常类似。只不过二叉树有两个节点，这里有任意个节点。

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