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 binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int maxDepth(TreeNode root) {
if(root == null)
return 0;
return max_deep(root);
}
public int max_deep(TreeNode root) {
if(root == null)
return 0;
int left = 0,right = 0;
if(root.left != null)
left = max_deep(root.left);
if(root.right != null)
right = max_deep(root.right);
return ((left > right)? left: right) + 1;
}
}