标签：des style blog ar io color sp for java
| 题目 |
Maximum Depth of Binary Tree |
| 通过率 | 44.2% |
| 难度 | Easy |
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;
java代码：
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public int maxDepth(TreeNode root) { if(root==null) return 0; else { int leftMax=maxDepth(root.left); int rightMax=maxDepth(root.right); return Math.max(leftMax,rightMax)+1; } } }
leetcode----------Maximum Depth of Binary Tree
标签：des style blog ar io color sp for java
原文地址：http://www.cnblogs.com/pku-min/p/4172572.html
