题目描述
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
代码
import java.util.*;
/**
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) {
if(root == null){
return 0;
}
int count = 0;
LinkedList<TreeNode> list = new LinkedList<>();
list.add(root);
int start = 0;
int end = 1;
while(!list.isEmpty()){
root = list.remove();
start ++;
if(root.left != null){
list.add(root.left);
}
if(root.right != null){
list.add(root.right);
}
if(start == end){
count ++;
start = 0;
end = list.size();
}
}
return count;
}
}