二叉树最大深度判断 Java

/**
 * 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 a=maxDepth(root.left)+1;
        int b=maxDepth(root.right)+1;
        int deep=a>b?a:b;
        return deep;
    }
}