Leetcode-Maximum Depth of Binary Tree

 1 /**
 2  * Definition for binary tree
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 public class Solution {
11     public int maxDepth(TreeNode root) {
12         return maxDepthRecur(root);        
13     }
14 
15     public int maxDepthRecur(TreeNode curNode){
16         if (curNode==null) return 0;
17   
18         int depth = Math.max(maxDepthRecur(curNode.left),maxDepthRecur(curNode.right))+1;
19         return depth;
20 
21     }    
22 }