Maximum Depth of Binary Tree
2017-09-02 20:21
274 查看
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.
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.
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { public int maxDepth(TreeNode root) { if (root == null) { return 0; } int left = maxDepth(root.left); int right = maxDepth(root.right); return Math.max(left, right) + 1; } }
相关文章推荐
- LeetCode - Maximum Depth of Binary Tree
- LeetCode 104 Maximum Depth of Binary Tree
- [Lintcode]Maximum Depth of Binary Tree
- LeetCode 104: Maximum Depth of Binary Tree
- Leetcode #104 Maximum Depth of Binary Tree
- 2016.6.26——Maximum Depth of Binary Tree
- 《leetCode》: Maximum Depth of Binary Tree
- leetcode [Maximum Depth of Binary Tree]
- Maximum Depth of Binary Tree
- LeetCode题解-104-Maximum Depth of Binary Tree
- [leetcode]_Maximum Depth of Binary Tree
- leetcode之Maximum Depth of Binary Tree
- leetcode-Minimum Depth of Binary Tree &&Maximum Depth of Binary Tree
- [LeetCode] Maximum Depth of Binary Tree
- LeetCode题解:Maximum Depth of Binary Tree
- Leetcode: Maximum Depth of Binary Tree
- leetcode -- Maximum Depth of Binary Tree -- 重点
- leetcode 24: Maximum Depth of Binary Tree
- LeetCode——Maximum Depth of Binary Tree
- Maximum Depth of Binary Tree