Max depth of tree

Given a binary tree, find its maximum depth.

• Time: O(N)
• Space: O(1)

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