leetcode_104._Maximum Depth of Binary Tree(C++)(easy)
来源:互联网 发布:mac os游戏推荐 编辑:程序博客网 时间:2024/05/29 04:21
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.
思路一:
可以利用递归的方式
/**
* Definition for a binary tree node.
* 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;
int left = maxDepth(root -> left);
int right = maxDepth(root -> right);
return ( left > right )? left+1 : right+1 ;
}
};
思路二:
利用队列
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root == NULL)
return 0;
queue<TreeNode*> que;
que.push(root);
int count = 1;
int depth = 0;
while(!que.empty())
{
TreeNode* tmp = que.front();
que.pop();
count--;
if(tmp -> left)
{
que.push(tmp -> left);
}
if(tmp -> right)
{
que.push(tmp -> right);
}
if(count == 0)
{
depth++;
count += que.size();
}
}
return depth;
}
};
- leetcode_104._Maximum Depth of Binary Tree(C++)(easy)
- LeetCode:104_Maximum Depth of Binary Tree | 二叉树的最大深度 | Easy
- leetcode第一刷_Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree(easy)
- 104. Maximum Depth of Binary Tree (Easy)
- 【leetcode】【Easy】【104. Maximum Depth of Binary Tree】【tree】
- 111.Minimum Depth of Binary Tree(Tree-Easy)
- leetcode_题解_Maximum Depth of Binary Tree_简单题
- LeetCode:104_Maximum Depth of Binary Tree | 二叉树的最大深度 | 深度优先与广度优先深入理解
- LeetCode刷题(C++)——Maximum Depth of Binary Tree(Easy)
- [Leetcode 104, Easy] Minimum (Maximum) Depth of Binary Tree
- Minimum Depth of Binary Tree——LeetCode(Easy)
- Minimum Depth of Binary Tree----easy
- [Leetcode 111, Easy] Minimum Depth of Binary Tree
- 【LeetCode】(104)Maximum Depth of Binary Tree(Easy)
- <LeetCode><Easy> 111 Minimum Depth of Binary Tree
- Leetcode----104. Maximum Depth of Binary Tree(easy)
- 104. Maximum Depth of Binary Tree [easy] (Python)
- skiplist 跳表详解及其编程实现
- 寻找无序数组中第k大的数
- sublime text 3快捷键
- HashMap多线程并发问题分析
- ERROR 1153 (08S01): Got a packet bigger than 'max_allowed_packet' bytes
- leetcode_104._Maximum Depth of Binary Tree(C++)(easy)
- android scroller用法介绍
- 最新最实用的公式技巧大汇总!
- 快速求正整数次幂
- Nginx 入门配置
- java.io.File 删除文件delete()和deleteOnExit()的区别
- Jeecg 切换默认首页方法
- 选择语句和循环语句的使用
- 一套效果图适配(Android和IOS)全尺寸和标注规范-(结果)