/*
// Definition for a Node.
class Node {
public int val;
public List<Node> children;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, List<Node> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public int maxDepth(Node root) {
// base case
if (root == null) return 0;
int depth = 0;
// 递归遍历得到子树中的最大深度
for (Node child : root.children) {
depth = Math.max(depth, maxDepth(child));
}
return 1 + depth;
}
}