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.

Have you met this question in a real interview? 

Yes

Example

Given a binary tree as follow:

  1
 / \ 
2   3
   / \
  4   5

The maximum depth is 3.

有空会写写lintcode上的题。

这道题是要求树的高度，采用递归的写法。

代码：

public int maxDepth(TreeNode root) {
        // write your code here
        if(root == null) return 0;
        if(root.left == null && root.right == null){
            return 1;
        }
        return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
    }