文档讲解:代码随想录二叉树
视频讲解:二叉树 BILIBILI
状态:
二叉树理论基础
二叉树的遍历方式:
- 深度优先遍历:先往深走,遇到叶子节点再往回走
- 广度优先遍历:一层一层去遍历
深度优先遍历
- 前序遍历——中左右(递归法,迭代法)
- 中序遍历——左中右(递归法,迭代法)
- 后序遍历——左右中(递归法,迭代法)
前序中序后序里的前中后可以理解为中间节点所在的位置
二叉树代码如下:
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;
}
}
二叉树的深度遍历(递归法)
方法:
- 确定递归函数的参数和返回值
- 确定终止条件
- 确定单层递归的逻辑
在二叉树遍历中:
- 递归函数参数是TreeNode,没有返回值
- 终止条件是TreeNode对象为null
- 单层递归逻辑就是确定左右中节点的顺序
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
preorder(root, list);
return list;
}
public void preorder(TreeNode root, ArrayList<Integer> list) {
if(root == null)return;
list.add(root.val);
preorder(root.left, list);
preorder(root.right, list);
}
}
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
postorder(root, list);
return list;
}
public void postorder(TreeNode root, ArrayList<Integer> list) {
if(root == null)return;
postorder(root.left, list);
postorder(root.right, list);
list.add(root.val);
}
}
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
inorder(root, list);
return list;
}
public void inorder(TreeNode root, ArrayList<Integer> list) {
if(root == null)return;
inorder(root.left, list);
list.add(root.val);
inorder(root.right, list);
}
}
二叉树的深度遍历(迭代法)
使用栈去书写,但应注意的是,栈是先进后出,故前序遍历加入栈的顺序右左
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
ArrayDeque<TreeNode> deque = new ArrayDeque<>();
if(root == null)return list;
deque.push(root);
while(!deque.isEmpty()) {
TreeNode node = deque.pop();
list.add(node.val);
if(node.right != null)deque.push(node.right);
if(node.left != null)deque.push(node.left);
}
return list;
}
}
后序遍历实际上就是前序遍历的方法得出结果后反转一下,只是左右节点加入栈的顺序要调换
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
ArrayDeque<TreeNode> deque = new ArrayDeque<>();
if(root == null)return list;
deque.push(root);
while(!deque.isEmpty()) {
TreeNode node = deque.pop();
list.add(node.val);
if(node.left != null)deque.push(node.left);
if(node.right != null)deque.push(node.right);
}
Collections.reverse(list);
return list;
}
}
中序遍历相对复杂,前后序遍历实际上是边遍历边操作,而中序遍历是先遍历后操作
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
ArrayDeque<TreeNode> deque = new ArrayDeque<>();
TreeNode cur = root;
while(cur != null || !deque.isEmpty()) {
if(cur != null) {
deque.push(cur);
cur = cur.left;
} else {
cur = deque.pop();
list.add(cur.val);
cur = cur.right;
}
}
return list;
}
}
二叉树的深度遍历(统一迭代法)
采用标记中间节点的方式,先按顺序加入前中后节点,在中间节点后加null,表示后面的中间节点是要进行操作的。
// 前序遍历
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();
if(root == null)return list;
stack.push(root);
while(!stack.isEmpty()) {
TreeNode cur = stack.peek();
if(cur != null) {
stack.pop();
if(cur.right != null)stack.push(cur.right);
if(cur.left != null)stack.push(cur.left);
stack.push(cur);
stack.push(null);
} else {
stack.pop();
cur = stack.pop();
list.add(cur.val);
}
}
return list;
}
}
// 后序遍历
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();
if(root == null)return list;
stack.push(root);
while(!stack.isEmpty()) {
TreeNode cur = stack.peek();
if(cur != null) {
stack.pop();
stack.push(cur);
stack.push(null);
if(cur.right != null)stack.push(cur.right);
if(cur.left != null)stack.push(cur.left);
} else {
stack.pop();
cur = stack.pop();
list.add(cur.val);
}
}
return list;
}
}
// 中序遍历
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();
if(root == null)return list;
stack.push(root);
while(!stack.isEmpty()) {
TreeNode cur = stack.peek();
if(cur != null) {
stack.pop();
if(cur.right != null)stack.push(cur.right);
stack.push(cur);
stack.push(null);
if(cur.left != null)stack.push(cur.left);
} else {
stack.pop();
cur = stack.pop();
list.add(cur.val);
}
}
return list;
}
}
二叉树层序遍历
// 迭代法
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
if(root == null)return res;
ArrayDeque<TreeNode> deque = new ArrayDeque<>();
deque.add(root);
while(!deque.isEmpty()) {
ArrayList<Integer> line = new ArrayList<>();
int size = deque.size();
for(int i = 0; i < size; i++) {
TreeNode t = deque.pop();
line.add(t.val);
if(t.left != null)deque.add(t.left);
if(t.right != null)deque.add(t.right);
}
res.add(line);
}
return res;
}
}
// 迭代
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
checkFunc(root, res, 0);
return res;
}
public void checkFunc(TreeNode root, List<List<Integer>> res, int deep) {
if(root == null)return;
deep++;
if(res.size() < deep) {
ArrayList<Integer> line = new ArrayList<>();
res.add(line);
}
res.get(deep - 1).add(root.val);
checkFunc(root.left, res, deep);
checkFunc(root.right, res, deep);
}
}
class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
if(root == null)return res;
ArrayDeque<TreeNode> deque = new ArrayDeque<>();
deque.add(root);
while(!deque.isEmpty()) {
ArrayList<Integer> line = new ArrayList<>();
int size = deque.size();
for(int i = 0; i < size; i++) {
TreeNode cur = deque.pop();
line.add(cur.val);
if(cur.left != null)deque.add(cur.left);
if(cur.right != null)deque.add(cur.right);
}
res.add(line);
}
Collections.reverse(res);
return res;
}
}
class Solution {
public List<Integer> rightSideView(TreeNode root) {
List<Integer> res = new ArrayList<>();
if(root == null)return res;
ArrayDeque<TreeNode> deque = new ArrayDeque<>();
deque.add(root);
while(!deque.isEmpty()) {
int size = deque.size();
for(int i = 0; i < size; i++) {
TreeNode cur = deque.pop();
if(i == size - 1)res.add(cur.val);
if(cur.left != null)deque.add(cur.left);
if(cur.right != null)deque.add(cur.right);
}
}
return res;
}
}
class Solution {
public List<Double> averageOfLevels(TreeNode root) {
List<Double> res = new ArrayList<>();
if(root == null)return res;
ArrayDeque<TreeNode> deque = new ArrayDeque<>();
deque.add(root);
while(!deque.isEmpty()) {
int size = deque.size();
double sum = 0;
for(int i = 0; i < size; i++) {
TreeNode cur = deque.pop();
sum += cur.val;
if(cur.left != null)deque.add(cur.left);
if(cur.right != null)deque.add(cur.right);
}
res.add(1.00000 * sum / size);
}
return res;
}
}
class Solution {
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> res = new ArrayList<>();
if(root == null)return res;
ArrayDeque<Node> deque = new ArrayDeque<>();
deque.add(root);
while(!deque.isEmpty()) {
int size = deque.size();
ArrayList<Integer> line = new ArrayList<>();
for(int i = 0; i < size; i++) {
Node cur = deque.pop();
line.add(cur.val);
for(Node node : cur.children) {
if(node != null)deque.add(node);
}
}
res.add(line);
}
return res;
}
}
class Solution {
public List<Integer> largestValues(TreeNode root) {
List<Integer> res = new ArrayList<>();
if(root == null)return res;
ArrayDeque<TreeNode> deque = new ArrayDeque<>();
deque.add(root);
while(!deque.isEmpty()) {
int size = deque.size();
int max = deque.peek().val;
for(int i = 0; i < size; i++) {
TreeNode cur = deque.pop();
if(max < cur.val)max = cur.val;
if(cur.left != null)deque.add(cur.left);
if(cur.right != null)deque.add(cur.right);
}
res.add(max);
}
return res;
}
}
《代码随想录》里是记录前一个节点的方式,我觉得我的方法可能更适合我一点
class Solution {
public Node connect(Node root) {
if(root == null)return null;
ArrayDeque<Node> deque = new ArrayDeque<>();
deque.add(root);
while(!deque.isEmpty()) {
int size = deque.size();
for(int i = 0; i < size; i++) {
Node cur = deque.pop();
cur.next = i == size - 1 ? null: deque.peek();
if(cur.left != null)deque.add(cur.left);
if(cur.right != null)deque.add(cur.right);
}
}
return root;
}
}
LeetCode 117.填充每个节点的下一个右侧节点指针II
class Solution {
public Node connect(Node root) {
if(root == null)return null;
ArrayDeque<Node> deque = new ArrayDeque<>();
deque.add(root);
while(!deque.isEmpty()) {
int size = deque.size();
for(int i = 0; i < size; i++) {
Node cur = deque.pop();
cur.next = i == size - 1 ? null : deque.peek();
if(cur.left != null)deque.add(cur.left);
if(cur.right != null)deque.add(cur.right);
}
}
return root;
}
}
class Solution {
public int maxDepth(TreeNode root) {
if(root == null)return 0;
int deep = 0;
ArrayDeque<TreeNode> deque = new ArrayDeque<>();
deque.add(root);
while(!deque.isEmpty()) {
int size = deque.size();
for(int i = 0; i < size; i++) {
TreeNode cur = deque.pop();
if(cur.left != null)deque.add(cur.left);
if(cur.right != null)deque.add(cur.right);
}
deep++;
}
return deep;
}
}
class Solution {
public int minDepth(TreeNode root) {
if(root == null)return 0;
int deep = 0;
ArrayDeque<TreeNode> deque = new ArrayDeque<>();
deque.add(root);
while(!deque.isEmpty()) {
deep++;
int size = deque.size();
for(int i = 0; i < size; i++) {
TreeNode cur = deque.pop();
if(cur.left != null) deque.add(cur.left);
if(cur.right != null)deque.add(cur.right);
if(cur.left == null && cur.right == null)return deep;
}
}
return deep;
}
}
碎碎念:今天状态不太行,一整天都是麻了的状态,还好晚上恢复了,才使得今天进度往前走了一小步。