/**
 * 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;
        }
        
        if(root.left==null && root.right==null){
            return 1;
        }
        
        return 1+Math.max(maxDepth(root.left),maxDepth(root.right));
    }
}