题目
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.
代码
/** * Definition for binary tree * public class TreeNode { *int val; *TreeNode left; *TreeNode right; *TreeNode(int x) { val = x; } * } */public class Solution {List<Integer> deep_list=new ArrayList<Integer>();public int maxDepth(TreeNode root) {if(root==null) return 0;getDepth(root,1);int max=1;for(int i=0;i<deep_list.size()-1;i++){if(deep_list.get(i)>max){max=deep_list.get(i);}}return max;}public void getDepth(TreeNode root,int height){if(root==null){deep_list.add(height-1) ;return;}getDepth(root.left,height+1);getDepth(root.right,height+1);}}
代码下载：https://github.com/jimenbian/GarvinLeetCode
/********************************
* 本文来自博客 “李博Garvin“
* 转载请标明出处:
******************************************/
，想起那座山，那个城，那些人……
