LeetCode OJ 104. 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.

很简单，直接上代码：

 1 /**
 2  * Definition for a binary tree node.
 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         if(root == null) return 0;
13
14         int leftmax = maxDepth(root.left);
15         int rightmax = maxDepth(root.right);
16
17         return leftmax>rightmax?leftmax+1:rightmax+1;
18     }
19 }