LeetCode 104. Maximum Depth of Binary Tree
2018-01-02 16:46
337 查看
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.
计算二叉树的最大深度，没什么好说的，记录一下
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
计算二叉树的最大深度，没什么好说的，记录一下
public int maxDepth(TreeNode root) {
return maxDepthNum(root, 0);
}
public int maxDepthNum(TreeNode root, int currentDepth) {
if (root == null) {
return currentDepth;
}
currentDepth++;
return Math.max(maxDepthNum(root.left,currentDepth),maxDepthNum(root.right,currentDepth));
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [Leetcode] binary tree 右视问题
- LeetCode-104. Maximum Depth of Binary Tree
- 第十八周：[Leetcode]111. Minimum Depth of Binary Tree
- 【LeetCode】104.Maximum Depth of Binary Tree
- leetcode 每日一题 104. Maximum Depth of Binary Tree
- 【leetcode】104. Maximum Depth of Binary Tree
- 【Leetcode】111. Minimum Depth of Binary Tree
- [LeetCode] 111. Minimum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- Leetcode 111. Minimum Depth of Binary Tree
- 算法系列（17） Leetcode 104. Maximum Depth of Binary Tree
- [leetcode: Python]104. Maximum Depth of Binary Tree
- LeetCode: Binary Tree Sum相关题目合集
- LeetCode 104. Maximum Depth of Binary Tree
- leetcode--111. Minimum Depth of Binary Tree
- [LeetCode] 111. Minimum Depth of Binary Tree
- [LeetCode]104. Maximum Depth of Binary Tree
- Invert Binary Tree -- leetcode
- leetcode 104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree