LeetCode 104 Maximum Depth of Binary Tree JAVA

代码如下，递归。

public class Solution {

    public int maxDepth(TreeNode root) {
        if (root == null) return 0;
        int left = maxDepth(root.left);
        int right = maxDepth(root.right);
        return 1 + (left > right ? left : right);
    }
}