[LeetCode] Maximum Depth of Binary Tree

Thought:
What's the problem....

Code:
public class Solution {
    public int maxDepth(TreeNode root) {
        if (root == null) return 0;
        else return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
    }
}