#111 Minimum Depth of Binary Tree & #104 Maximum Depth of Binary Tree
来源:互联网 发布:软件密码破解工具 编辑:程序博客网 时间:2024/05/22 12:21
#111 Minimum Depth of Binary
题目:
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.
题解:
我用的递归解法。
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public int minDepth(TreeNode root) { if(root == null)return 0; if(root.left == null)return minDepth(root.right)+1; if(root.right == null)return minDepth(root.left)+1; return Math.min(minDepth(root.left),minDepth(root.right))+1; }}
还有一种BFS的解法,用的迭代。网上找的程序:http://blog.csdn.net/sbitswc/article/details/26526031。
public int minDepthBFS(TreeNode root){if(root == null) return 0;ArrayList<TreeNode> last = new ArrayList<TreeNode>();last.add(root);int count =1;while(!last.isEmpty()){ArrayList<TreeNode> cur = new ArrayList<TreeNode>();for (TreeNode treeNode : last) {if(treeNode.left == null && treeNode.right == null) return count;if(treeNode.left != null) cur.add(treeNode.left);if(treeNode.right != null) cur.add(treeNode.right);}count++;last = new ArrayList<TreeNode>(cur);}return count;}
#104 Maximum Depth of Binary Tree
题目:
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. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public int maxDepth(TreeNode root) { if(root == null)return 0; return Math.max(maxDepth(root.left),maxDepth(root.right))+1; }}
0 0
- Minimum Depth of Binary Tree,Maximum Depth of Binary Tree
- #111 Minimum Depth of Binary Tree & #104 Maximum Depth of Binary Tree
- <LeetCode OJ> (104 / 111) Maximum & Minimum Depth of Binary Tree
- Minimum(Maximum) Depth of Binary Tree
- Maximum & Minimum Depth of Binary Tree
- [Leetcode] Maximum |Minimum Depth of Binary Tree
- LeetCode-Maximum/Minimum Depth of Binary Tree
- 111. Minimum & Maximum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Minimum Depth of Binary Tree
- Java Reflection - Dynamic Class Loading and Reloading
- 1050 循环数组最大子段和
- 微软100题(45)几道雅虎面试题
- 子类继承父类,但是每个子类又不能全部拥有基类的属性
- virtual 虚拟机安装Ubnutu
- #111 Minimum Depth of Binary Tree & #104 Maximum Depth of Binary Tree
- HDU5242.Game——贪心
- (大数据之flume)Flume(NG)架构设计要点及配置实践
- 【Android】Uri、UriMatcher、ContentUris详解
- java享元模式
- 飞机大战-MyView游戏主界面的实现
- OpenGL的状态查询
- LeetCode Contains Duplicate
- Objective-C语法之NSArray和NSMutableArray