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 to the farthest leaf node. Note:A leaf is a node with no children. ...
2014-10-26 07:32 9 17322 推薦指數：
相關推薦
[LeetCode] Maximum Binary Tree 最大二叉樹
Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: The root is the maximum number ...
[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] 662. Maximum Width of Binary Tree 二叉樹的最大寬度
Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. ...
[LeetCode] 124. Binary Tree Maximum Path Sum 求二叉樹的最大路徑和
Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some ...
[LeetCode 124] - 二叉樹最大路徑和(Binary Tree Maximum Path Sum)
二叉樹的最大路徑，就是其左子樹的最大路徑加上右子樹的最大路徑。看起來可以從根節點出發通過深度優先遞歸來求解 ...
[LeetCode] Maximum Depth of N-ary Tree N叉樹的最大深度
Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down ...