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
.
方法一:递归
/*
// 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 == NULL)
return 0;
int depth = 0;
for (int i = 0; i < root->children.size(); i++)
{
depth = max(depth, maxDepth(root->children[i]));
}
return depth+1;
}
};
方法二:迭代
/*
// 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 == NULL)
return 0;
int maxNum = 0;
queue<Node*> nodes;
nodes.push(root);
int count = 1;
int nextCount = 0;
while (!nodes.empty())
{
count = nodes.size();
for (int i = 0; i < count; i++)
{
Node* temp = nodes.front();
nodes.pop();
int len = temp->children.size();
for (int i = 0; i < len; i++)
{
nodes.push(temp->children[i]);
}
}
maxNum++;
}
return maxNum;
}
};