深度遍历
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public:
int maxDepth(Node* root) {
if(!root) return 0;
else if(!root->children.size()) return 1;
else
{
int dep = 0;
for(Node * node : root->children)
{
dep = max(dep,maxDepth(node)+1);
}
return dep;
}
}
};