标签：des style blog http color io art ar
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 public class Solution { 2 public int maxDepth(TreeNode root) { 3 if(root == null) return 0; 4 if(root.left == null && root.right == null) return 1; 5 int left = 0,right = 0; 6 left = maxDepth(root.left); 7 right = maxDepth(root.right); 8 return Math.max(left,right) + 1; 9 } 10 }
[leetcode]Maximum Depth of Binary Tree,布布扣,bubuko.com
[leetcode]Maximum Depth of Binary Tree
标签：des style blog http color io art ar
原文地址：http://www.cnblogs.com/huntfor/p/3882114.html
