104MaximumDepthofBinaryTree

public class Solution {
public int maxDepth(TreeNode root) {
int lmax, rmax;
if(root == null) {
return 0;
}
lmax = maxDepth(root.left);
rmax = maxDepth(root.right);
if(lmax >= rmax)
return lmax+1;
else
return rmax+1;
}
}