LeetCode 之 Minimum Depth of Binary Tree
来源:互联网 发布:沈飞 成飞 知乎 编辑:程序博客网 时间:2024/06/05 19:50
Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
BST中深度的问题,我们可以递归(DFS),也可以迭代解决(BFS),我习惯性用迭代,主要是用习惯了。需要注意的是,判断条件是叶子节点,不是左右子树,代码如下:
class Solution {public: int minDepth(TreeNode* root) { if(root==NULL) return 0; //if(root->left&&!root->right||!root->left&&root->right) return 2; queue<TreeNode*> A; A.push(root);A.push(NULL); int depth=1; while(!A.empty()){ auto B=A.front(); if(B==NULL){ depth++;A.pop(); } else{ if(!B->left&&!B->right) return depth; else { if(B->left) A.push(B->left); if(B->right) A.push(B->right); A.pop(); if(A.front()==NULL) A.push(NULL); } } } return depth; }};
0 0
- LeetCode 之 Minimum Depth of Binary Tree
- LeetCode之Minimum Depth of Binary Tree
- LeetCode之Minimum Depth of Binary Tree
- leetcode之Minimum Depth of Binary Tree
- leetcode 之 Minimum Depth of Binary Tree
- leetcode之Minimum Depth of Binary Tree
- LeetCode之Minimum Depth of Binary Tree
- LeetCode 之 Minimum Depth of Binary Tree
- leetcode之Minimum Depth of Binary Tree
- leetcode之Minimum Depth of Binary Tree
- leetcode之Minimum Depth of Binary Tree
- LeetCode 之 Minimum Depth of Binary Tree
- LeetCode: Minimum Depth of Binary Tree
- [Leetcode] Minimum Depth of Binary Tree
- LeetCode : Minimum Depth of Binary Tree
- leetcode 31: Minimum Depth of Binary Tree
- [LeetCode] Minimum Depth of Binary Tree - BFS
- [LeetCode] Minimum Depth of Binary Tree - DFS
- hibernate的Configuration类
- TCP与UDP的区别
- torch学习(六) rnn package
- 黑马程序员_static关键字和构造代码块
- 黑马程序员--File类
- LeetCode 之 Minimum Depth of Binary Tree
- UILabel详解 转载于 Triple_Vip http://blog.csdn.net/zhaopenghhhhhh/article/details/16331041
- mysql5.6-5.7配置文件自己的理解
- hpuoj 1653: 词组缩写
- android长连接心跳机制
- A cost-effective recommender system for taxi drivers
- 深拷贝
- C - 结构体 Homework
- sift特征--关键点搜索与定位