[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 @ Python
原題地址：http: oj.leetcode.com problems 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 do ...
2014-05-11 18:23 0 3285 推薦指數：
相關推薦
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 ...
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]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]Balanced Binary Tree @ Python
原題地址：http://oj.leetcode.com/problems/balanced-binary-tree/ 題意：判斷一顆二叉樹是否是平衡二叉樹。 解題思路：在這道題里，平衡二叉樹的定義是二叉樹的任意節點的兩顆子樹之間的高度差小於等於1。這實際上是AVL樹的定義。首先要寫一個計算 ...
[leetcode]Binary Tree Inorder Traversal @ Python
原題地址：http://oj.leetcode.com/problems/binary-tree-inorder-traversal/ 題意：二叉樹的中序遍歷。這道題用遞歸比較簡單，考察的是非遞歸實現二叉樹中序遍歷。中序遍歷順序為：左子樹，根，右子樹。如此遞歸下去。 解題思路：假設樹為： 1 / \ ...