MaximumDepthofBinaryTree.java

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int maxDepth(TreeNode root) {
        
        int left = 1;
        int right = 1;
        
        if(root==null){
          return 0;    
        }
        
        if(root.left==null && root.right==null){
            return 1;
        }
        
        
        if(root.left!=null){
            left+=maxDepth(root.left);
            System.out.println(left);
        }
        
        if(root.right!=null){
            right+=maxDepth(root.right);
            System.out.println(right);
        }
        
        if(left>right)
        {
            return left;
        }
        
        return right;
    }
}