目录
【层序遍历10题】
层序遍历 & 递归遍历
- 层序遍历:从上到下,从左到右,访问所有节点,对应BFS(广度优先搜索),利用队列实现。
- 递归遍历:一直访问到最深的节点,然后回溯到它的父节点,遍历另一条路径,直到遍历完所有节点,对应DFS(深度优先搜索),利用递归/栈实现。
- 102.二叉树的层序遍历(opens new window)【层序遍历的模板题】
利用队列实现
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
Deque<TreeNode> queue = new ArrayDeque<>();
List<List<Integer>> result = new ArrayList<>();
if (root == null) return result;
TreeNode cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
List<Integer> levelItem = new ArrayList<>(); // 存储当前层的所有节点的val
int size = queue.size(); // 获取队列长度
// 遍历的次数由队列的长度决定
for (int i = 0; i < size; i++){
cur = queue.poll();
levelItem.add(cur.val);
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
result.add(levelItem);
}
return result;
}
}
- 注意:不能直接将queue.size()直接放入for循环,因为queue长度在for循环内部会变
102自顶而下的层序遍历 + 反转List
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> result = new ArrayList<>();
Deque<TreeNode> queue = new ArrayDeque<>();
if (root == null) return result;
TreeNode cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
List<Integer> levelItem = new ArrayList<>();
int size = queue.size();
for(int i = 0; i < size; i++){
cur = queue.poll();
levelItem.add(cur.val);
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
result.add(levelItem);
}
Collections.reverse(result);
return result;
}
}
只需要记录当前层的最后一个元素
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> result = new ArrayList<>();
Deque<TreeNode> queue = new ArrayDeque<>();
if (root == null) return result;
TreeNode cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
int size = queue.size();
for(int i = 0; i < size; i++){
cur = queue.poll();
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
result.add(cur.val); // 只需要记录当前层的最后一个元素
}
return result;
}
}
对当前层的各个元素进行求和,最后除以队列的大小取均值
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Double> averageOfLevels(TreeNode root) {
Deque<TreeNode> queue = new ArrayDeque<>();
List<Double> result = new ArrayList<>();
if (root == null) return result;
TreeNode cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
double sum = 0; // 用于记录每层元素的和
int size = queue.size(); // 获取队列长度
// 遍历的次数由队列的长度决定
for (int i = 0; i < size; i++){
cur = queue.poll();
sum += cur.val;
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
result.add(sum / size);
}
return result;
}
}
和模板题的思路一样,只不过访问子节点的时候要加一层循环
/*
// Definition for a Node.
class Node {
public int val;
public List<Node> children;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, List<Node> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> result = new ArrayList<>();
Deque<Node> queue = new ArrayDeque<>();
if (root == null) return result;
Node cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
List<Integer> levelItem = new ArrayList<>();
int size = queue.size();
for (int i = 0; i < size; i++){
cur = queue.poll();
levelItem.add(cur.val);
for (int j = 0; cur.children != null && j < cur.children.size(); j++){
queue.offer(cur.children.get(j));
}
}
result.add(levelItem);
}
return result;
}
}
- 注意:List对象在获取size()时,习惯先判断是否为null,不为null再调用size(),如果为null调用size()会报空指针异常
在for循环内部比较,记录最大值
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> largestValues(TreeNode root) {
Deque<TreeNode> queue = new ArrayDeque<>();
List<Integer> result = new ArrayList<>();
if (root == null) return result;
TreeNode cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
int max = queue.peek().val; // 注意:返回的是节点,获取的是val值
int size = queue.size(); // 获取队列长度
// 遍历的次数由队列的长度决定
for (int i = 0; i < size; i++){
cur = queue.poll();
max = Math.max(max, cur.val);
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
result.add(max);
}
return result;
}
}
为每一层最左边的节点虚构一个左边节点pre,让左边的节点pre指向当前节点cur,再将当前节点cur指定为下一个节点的左边节点pre
/*
// Definition for a Node.
class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, Node _left, Node _right, Node _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
};
*/
class Solution {
public Node connect(Node root) {
Deque<Node> queue = new ArrayDeque<>();
if (root == null) return root;
Node cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
int size = queue.size(); // 获取队列长度
Node pre = new Node(); // 为每一层最左边的节点虚构一个前节点
// 遍历的次数由队列的长度决定
for (int i = 0; i < size; i++){
cur = queue.poll();
pre.next = cur; // 让左边的节点指向当前节点
pre = cur; // 当前节点指定为下一个节点的左边节点
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
cur.next = null; // 让当前层的最后一个节点指向null
}
return root;
}
}
和116的代码一样,无论是完全二叉树还是普通的二叉树,利用队列的层序遍历,当前层的元素都能从左到右遍历
/*
// Definition for a Node.
class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, Node _left, Node _right, Node _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
};
*/
class Solution {
public Node connect(Node root) {
Deque<Node> queue = new ArrayDeque<>();
if (root == null) return root;
Node cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
int size = queue.size(); // 获取队列长度
Node pre = new Node(); // 为每一层最左边的节点虚构一个前节点
// 遍历的次数由队列的长度决定
for (int i = 0; i < size; i++){
cur = queue.poll();
pre.next = cur; // 让左边的节点指向当前节点
pre = cur; // 当前节点指定为下一个节点的左边节点
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
cur.next = null; // 让当前层的最后一个节点指向null
}
return root;
}
}
利用模板,每一层遍历完之后,深度+1
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int maxDepth(TreeNode root) {
Deque<TreeNode> queue = new ArrayDeque<>();
int result = 0;
if (root == null) return result;
TreeNode cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
int size = queue.size(); // 获取队列长度
// 遍历的次数由队列的长度决定
for (int i = 0; i < size; i++){
cur = queue.poll();
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
result++;
}
return result;
}
}
如果遍历到一个节点没有左节点和右节点,那么该节点就是叶子节点,直接返回结果即可。
注意,要在遍历当前层之前更新当前深度。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int minDepth(TreeNode root) {
Deque<TreeNode> queue = new ArrayDeque<>();
int result = 0;
if (root == null) return result;
TreeNode cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
int size = queue.size(); // 获取队列长度
result++; // 需要在遍历当前层之前更新当前深度
// 遍历的次数由队列的长度决定
for (int i = 0; i < size; i++){
cur = queue.poll();
// 如果遍历到一个节点没有左节点和右节点,那么该节点就是叶子节点,直接返回结果即可
if (cur.left == null && cur.right == null) return result;
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
}
return result;
}
}
【226.翻转二叉树】
A. 递归遍历
1、确定方法的形参和返回值:直接用的是提供的方法,输入值和返回值都是root
2、确定终止条件:root=null则不需要反转,直接返回
3、确定单层递归逻辑:反转左右子树(递归实现)+左右子树互换,有点像动态优化的思路
方法一 递归(前序遍历)
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) return root;
// 递归 - 前序遍历
// 中
TreeNode tmp = root.left;
root.left = root.right;
root.right = tmp;
invertTree(root.left); // 左
invertTree(root.right); // 右
return root;
}
}
方法二 递归(后序遍历)
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) return root;
// 递归 - 后序遍历
invertTree(root.left); // 左
invertTree(root.right); // 右
// 中
TreeNode tmp = root.left;
root.left = root.right;
root.right = tmp;
return root;
}
}
方法三 递归(后序遍历)
注意:递归的【中序遍历】不能使用上面的模板,因为中序是左-中-右,左子树反转完,互换左右子树,再反转右子树,此时的右子树是由左子树互换过来的,无法完成题目的要求。
思路:可以反转左子树,互换左右子树,此时的左子树是原来没反转的右子树,继续反转左子树。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) return root;
// 递归 - 中序遍历
invertTree(root.left); // 左
// 中
TreeNode tmp = root.left;
root.left = root.right;
root.right = tmp;
invertTree(root.left); // 原来的右
return root;
}
}
B. 迭代遍历(统一迭代法)
思路:
- cur不为null的时候,按指定的遍历方式对应的入栈顺序将节点和null入栈
- cur为null的时候,获取栈顶(栈顶为当前访问的节点),互换该节点的左右子树
方法一 统一迭代(前序遍历)
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
Deque<TreeNode> stack = new LinkedList<>();
if (root == null) return root;
TreeNode cur = root;
stack.push(root);
while(!stack.isEmpty()){
cur = stack.pop();
// cur不为null,前序遍历(中左右),入栈顺序:右-左-中-null
if (cur != null){
if (cur.right != null) stack.push(cur.right);
if (cur.left != null) stack.push(cur.left);
stack.push(cur);
stack.push(null);
}
// cur为null,下一个弹出的节点即当前访问的节点,互换左右子树即可
else{
// 获取当前访问节点
cur = stack.pop();
// 互换当前节点的左右子树
TreeNode tmp = cur.left;
cur.left = cur.right;
cur.right = tmp;
}
}
return root;
}
}
方法二 统一迭代(中序遍历)
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
Deque<TreeNode> stack = new LinkedList<>();
if (root == null) return root;
TreeNode cur = root;
stack.push(root);
while(!stack.isEmpty()){
cur = stack.pop();
// cur不为null,中序遍历(左中右),入栈顺序:右-中-null-左
if (cur != null){
if (cur.right != null) stack.push(cur.right);
stack.push(cur);
stack.push(null);
if (cur.left != null) stack.push(cur.left);
}
// cur为null,下一个弹出的节点即当前访问的节点,互换左右子树即可
else{
// 获取当前访问节点
cur = stack.pop();
// 互换当前节点的左右子树
TreeNode tmp = cur.left;
cur.left = cur.right;
cur.right = tmp;
}
}
return root;
}
}
方法三 统一迭代(后序遍历)
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
Deque<TreeNode> stack = new LinkedList<>();
if (root == null) return root;
TreeNode cur = root;
stack.push(root);
while(!stack.isEmpty()){
cur = stack.pop();
// cur不为null,后序遍历(左右中),入栈顺序:中-null-右-左
if (cur != null){
stack.push(cur);
stack.push(null);
if (cur.right != null) stack.push(cur.right);
if (cur.left != null) stack.push(cur.left);
}
// cur为null,下一个弹出的节点即当前访问的节点,互换左右子树即可
else{
// 获取当前访问节点
cur = stack.pop();
// 互换当前节点的左右子树
TreeNode tmp = cur.left;
cur.left = cur.right;
cur.right = tmp;
}
}
return root;
}
}
C、层序遍历
思路:队头节点弹出后,直接互换该节点的左右子树
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
Deque<TreeNode> queue = new ArrayDeque<>();
if (root == null) return root;
TreeNode cur = root;
queue.offer(cur);
while (!queue.isEmpty()){
int size = queue.size(); // 获取队列长度
// 遍历的次数由队列的长度决定
for (int i = 0; i < size; i++){
// 获取当前访问节点(队头节点)
cur = queue.poll();
// 反转当前节点的左右子树
TreeNode tmp = cur.left;
cur.left = cur.right;
cur.right = tmp;
// 将左右节点入队,为下一层的遍历做准备
if (cur.left != null) queue.offer(cur.left);
if (cur.right != null) queue.offer(cur.right);
}
}
return root;
}
}
【101.对称二叉树 2】
方法一 递归(最简单,速度最快)
思路:创建递归方法
- 1、确定参数和返回值
- 参数:传入左右子树的root节点,两个节点都是TreeNode类型
- 返回值:递归方法用于判断左右子树是否对称,返回类型为布尔值
- 2、确定结束条件
- 如果两个都为null,则对称,返回true
- 如果只有其中一个为null,则不对称,返回false
- 两个都不为null,则符合三个条件才是对称,即左右节点的值相等,左右节点对应的子树的内侧子树对称和外侧子树对称
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
return judgeSymmetric(root.left, root.right);
}
public boolean judgeSymmetric(TreeNode left, TreeNode right){
// 如果两个都为null,则对称,返回true
if (left == null && right == null) return true;
// 如果只有其中一个为null,则不对称,返回false
if (left == null || right == null) return false;
// 两个都不为null,则符合三个条件才是对称
// 左右节点的值相等,左右节点对应的子树的内侧子树对称和外侧子树对称
return right.val == left.val && judgeSymmetric(left.right, right.left) && judgeSymmetric(left.left, right.right);
}
}
方法二 用两个队列遍历左右子树
思路:
1、创建两个队列,用于左子树和右子树的层序节点访问
2、将root节点的左右节点分别入队
3、循环判断左右子树是否对称
- 排除特殊情况
- 两个都为null,则不需要将左右节点存入队列,直接继续循环(continue)
- 其中一个为null,左右子树对应位置的节点有一个不存在,直接返回false
- 两个都不是null,左右子树对应位置的节点的值不相等,直接返回false
- 访问左子树,左节点入队,再右节点入队
- 访问右子树:右节点入队,再左节点入队
4、如果循环结束了,还没返回,证明左右子树对称,返回true
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
Deque<TreeNode> queue1 = new LinkedList<>(); // 左子树对应的队列
Deque<TreeNode> queue2 = new LinkedList<>(); // 右子树对应的队列
queue1.offer(root.left);
queue2.offer(root.right);
while (!queue1.isEmpty() && !queue2.isEmpty()){
int size1 = queue1.size();
// 一直都是size1 = size2,其中一个决定循环次数就行
for (int i = 0; i < size1; i++){
TreeNode cur1 = queue1.poll();
TreeNode cur2 = queue2.poll();
// 1、排除特殊情况
// 两个都为null
if (cur1 == null && cur2 == null) continue;
// 其中一个为null
if (cur1 == null || cur2 == null) return false;
// 两个都不是null
if (cur1.val != cur2.val) return false;
// 2、访问左子树:先遍历左节点,再遍历右节点
queue1.offer(cur1.left);
queue1.offer(cur1.right);
// 3、访问右子树:先遍历右节点,再遍历左节点
queue2.offer(cur2.right);
queue2.offer(cur2.left);
}
}
return true;
}
}
方法三 优化方法二,只用一个队列
思路:
1、创建队列
2、将root节点的左右节点分别入队
3、循环判断左右子树是否对称
- 排除特殊情况
- 两个都为null,则不需要将左右节点存入队列,直接继续循环(continue)
- 其中一个为null,左右子树对应位置的节点有一个不存在,直接返回false
- 两个都不是null,左右子树对应位置的节点的值不相等,直接返回false
- 将外侧节点入队
- 将内侧节点入队
4、如果循环结束了,还没返回,证明左右子树对称,返回true
示例:
1
2 2
3 4 4 3
56 78 87 65
队列变化情况:
【2,2】 -> 【3,3,4,4】-> 【5,5,6,6,7,7,8,8】
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
Deque<TreeNode> queue = new LinkedList<>();
queue.offer(root.left);
queue.offer(root.right);
while (!queue.isEmpty()){
int size = queue.size();
for (int i = 0; i < size; i++){
TreeNode cur1 = queue.poll();
TreeNode cur2 = queue.poll();
// 1、排除特殊情况
// 两个都为null
if (cur1 == null && cur2 == null) continue;
// 其中一个为null
if (cur1 == null || cur2 == null) return false;
// 两个都不是null
if (cur1.val != cur2.val) return false;
// 2、外侧节点入队
queue.offer(cur1.left); // 左子树的左节点
queue.offer(cur2.right); // 右子树的右节点
// 3、内侧节点入队
queue.offer(cur1.right); // 左子树的右节点
queue.offer(cur2.left); // 右子树的左节点
}
}
return true;
}
}