LeetCode：111_Minimum Depth of Binary Tree | 二叉樹的最小深度 | Easy
要求：此題正好和Maximum Depth of Binary Tree一題是相反的，即尋找二叉樹的最小的深度值：從根節點到最近的葉子節點的距離。 結題思路：和找最大距離不同之處在於：找最小距離要注意(l<r)? l+1:r+1的區別應用，因為可能存在左右子樹為空的情況，此時值就為 ...
原文：[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 to the nearest leaf node. Note:A leaf is a node with no children. ...
2014-10-22 07:27 3 14924 推薦指數：
相關推薦
LeetCode（111）：二叉樹的最小深度
Easy！ 題目描述： 給定一個二叉樹，找出其最小深度。 最小深度是從根節點到最近葉子節點的最短路徑上的節點數量。 說明: 葉子節點是指沒有子節點的節點。 示例: 給定二叉樹 [3,9,20,null,null,15,7], 返回它的最小深度 2. 解題思路： 二叉樹的經典 ...
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 ...
[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] Second Minimum Node In a Binary Tree 二叉樹中第二小的結點
Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero ...
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 ...
[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 ...