题目链接:https://leetcode.com/problems/maximum-depth-of-binary-tree/
Runtimes:16ms
1、问题
Given a binary 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.
2、分析
采用层次遍历,遍历的最后一个元素即是离根节点最远点的元素。也可以用深度优先遍历,取左右子节点深度最大的作为父节点的深度(这里根节点会是最高点,叶子节点是最低点)
3、小结
队列的使用,需要熟悉。
4、实现
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode *root) {
if(root == NULL)
return 0;
queue <int> qi;
queue <TreeNode *> tq;
qi.push(1);
tq.push(root);
int depth;
while(tq.size() > 0)
{
TreeNode *p = tq.front(); tq.pop();
depth = qi.front(); qi.pop();
if(p->left != NULL)
{
tq.push(p->left);
qi.push(depth + 1);
}
if(p->right != NULL)
{
tq.push(p->right);
qi.push(depth + 1);
}
}
return depth;
}
};
5、反思
总结一下队列的使用,特别是front()+pop()结合才能完成取后删除的整个过程。了解STL中队列的实现。