[LeetCode]104. Maximum Depth of Binary Tree
2017-10-20 17:04
429 查看
题目描述：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.
分析：查找一个二叉树的最大深度
解题思路:求二叉树的深度.递归求解，递归到当前节点如果为叶子结点时，返回1。求解左右子树中最大的二叉树深度。
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
分析：查找一个二叉树的最大深度
解题思路:求二叉树的深度.递归求解，递归到当前节点如果为叶子结点时，返回1。求解左右子树中最大的二叉树深度。
public int maxDepth(TreeNode root) {
if(root==null)return 0;
if(root.left==null&&root.right==null)return 1;
return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode-111. Minimum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- LeetCode 543. Diameter of Binary Tree
- Leetcode 111. Minimum Depth of Binary Tree
- [Leetcode] binary tree 右视问题
- leetcode 111. Minimum Depth of Binary Tree
- LeetCode——Binary Tree Inorder Traversal
- LeetCode 104. Maximum Depth of Binary Tree
- Invert Binary Tree -- leetcode
- Leetcode-111. Minimum Depth of Binary Tree
- LeetCode 545. Boundary of Binary Tree
- LeetCode 111. Minimum Depth of Binary Tree
- leetcode解题报告:104. Maximum Depth of Binary Tree
- <LeetCode OJ> Invert Binary Tree【226】
- 【LeetCode】104. Maximum Depth of Binary Tree
- 【LeetCode】104. Maximum Depth of Binary Tree (2 solutions)
- [LeetCode] 111. Minimum Depth of Binary Tree
- [LeetCode]111. Minimum Depth of Binary Tree
- LeetCode 111. Minimum Depth of Binary Tree
- LEETCODE —— Binary Tree的3 题 —— 3种非Recursive遍历