二叉树的深度
递归(DFS深度优先)
是时候展示一下绘画功力啦
思路就是这样,原谅我写字不好
import java.lang.Math;
public class Solution {
public int TreeDepth(TreeNode pRoot)
{
if(pRoot == null){
return 0;
}
return Math.max(TreeNode(pRoot.left), TreeNode(pNode.right)) + 1;
}
}
循环(BFS广度优先)
法1与法2相比,法2更好理解
依旧上图
借助队列来实现循环遍历每层节点
这个题让我加深了对DFS,和BFS的理解
import java.util.LinkedList;
import java.util.Queue;
//法1
public class Solution {
public int TreeDepth(TreeNode root) {
if(root == null){
return 0;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
int depth = 0;//深度
int count = 0;//当前层已遍历的节点数
int nextCount = 1;//当前层节点总数
boolean flag = true;
while(!queue.isEmpty()){
root = queue.poll();
count++;
if(root.left != null){
queue.offer(root.left);
}
if(root.right != null){
queue.offer(root.right);
}if(count == nextCount){//本层节点已遍历完毕
nextCount = queue.size();//下一层的节点数
count = 0;
depth++;
}
}
return depth;
}
}
//法2
public class Solution {
public int maxDepth(TreeNode root) {
if (root == null) {
return 0;
}
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.offer(root);
int ans = 0;
while (!queue.isEmpty()) {
int size = queue.size();
while (size > 0) {
TreeNode node = queue.poll();
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
size--;
}
ans++;
}
return ans;
}
}
拜拜下次见