题目描述
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
import java.lang.*;
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public int TreeDepth(TreeNode root) {
int maxDeep = 0;
int tempDeep = 0;
int result = calculateDeep(root,tempDeep);
return result;
}
public int calculateDeep(TreeNode root,int tempDeep){
//叶子节点
if(root == null){
return tempDeep;
}
tempDeep++;
int leftDeep = calculateDeep(root.left,tempDeep);
int rightDeep = calculateDeep(root.right,tempDeep);
return Math.max(leftDeep,rightDeep);
}
}