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 ...