[LeetCode] Minimum Depth of Binary Tree
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 ...
原文：LeetCode:Minimum Depth of Binary Tree,Maximum Depth of Binary Tree
LeetCode:Minimum Depth of Binary Tree 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. 算法 ...
2013-11-24 15:17 2 2658 推荐指数：
相关推荐
Minimum Depth of Binary Tree leetcode java
题目： 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 ...
[leetcode]Minimum Depth of Binary Tree @ Python
原题地址：http://oj.leetcode.com/problems/minimum-depth-of-binary-tree/ 题意： Given a binary tree, find its minimum depth. The minimum depth ...
[leetcode]Maximum Depth of Binary Tree @ Python
原题地址：https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/ 题意： Given a binary tree, find its maximum depth. The maximum depth ...
[LeetCode] 111. Minimum Depth of Binary Tree 二叉树的最小深度
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 ...
LeetCode：111_Minimum Depth of Binary Tree | 二叉树的最小深度 | Easy
要求：此题正好和Maximum Depth of Binary Tree一题是相反的，即寻找二叉树的最小的深度值：从根节点到最近的叶子节点的距离。 结题思路：和找最大距离不同之处在于：找最小距离要注意(l<r)? l+1:r+1的区别应用，因为可能存在左右子树为空的情况，此时值就为 ...
LeetCode：104_Maximum Depth of Binary Tree | 二叉树的最大深度 | Easy
要求：求二叉树的深度（二叉树的深度为最远叶子节点到根节点的距离，即根节点到最远叶子节点的距离） 有两种求解的思路，一种采用DFS的思想，一种采用BFS的思想，如下代码所示： ...
[LeetCode] 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 ...