[Leetcode] Maximum Depth of Binary Tree

时间：2014-10-16 05:07:53 收藏：0 阅读：235

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: Recursion.

 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         if(root==null)
13             return 0;
14         return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
15     }
16 }

原文：http://www.cnblogs.com/Phoebe815/p/4027900.html