Leetcode-Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Solution:

/**
 * 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) {
        return maxDepthRecur(root);        
    }

    public int maxDepthRecur(TreeNode curNode){
        if (curNode==null) return 0;
  
        int depth = Math.max(maxDepthRecur(curNode.left),maxDepthRecur(curNode.right))+1;
        return depth;

    }    
}