标签：des style blog ar io color sp for on
| 标题： | Maximum Depth of Binary Tree |
|
通过率： |
44.2% |
| 难度： | 简单 |
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 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 int depth1=0; 13 int depth2=0; 14 if(root==null) return 0; 15 //left 16 depth1=maxDepth(root.left); 17 depth2=maxDepth(root.right); 18 if(depth1>depth2) 19 return depth1+1; 20 else 21 return depth2+1; 22 } 23 }
leetcode------Maximum Depth of Binary Tree
标签：des style blog ar io color sp for on
原文地址：http://www.cnblogs.com/pkuYang/p/4171510.html
