题目描述
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
方法一:递归(只留这一个方法,目的是熟练应用递归)
package test;
class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
class Solution {
public int TreeDepth(TreeNode root) {
if(root == null){
return 0;
}
int left = TreeDepth(root.left);
int right = TreeDepth(root.right);
return Math.max(left, right)+1;//+1是根节点
}
}
public class Main{
public static void main(String[] args) {
TreeNode p1 = new TreeNode(8);
p1.left = new TreeNode(8);
p1.left.left = new TreeNode(9);
p1.left.right = new TreeNode(2);
p1.left.right.left = new TreeNode(4);
p1.left.right.right = new TreeNode(7);
p1.right = new TreeNode(7);
Solution p = new Solution();
int b = p.TreeDepth(p1);
System.out.println("结果:"+b);
}
}