本篇主要内容如下图大纲所示:
1.二叉树的前序遍历
递归法:
import java.util.ArrayList;
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
preorder(root, result);
return result;
}
void preorder(TreeNode root, List<Integer> result){
if(root == null) return;
result.add(root.val);
preorder(root.left, result);
preorder(root.right, result);
}
}
迭代法:
class Solution{
public List<Integer> pre(TreeNode root){
List<Integer> result = new ArrayList<>();
if(root == null) return result;
ArrayDeque<TreeNode> stack = new ArrayDeque<>();
stack.push(root);
while(!stack.isEmpty()){
TreeNode node = stack.pop();
; result.add(node.val)
if(node.right != null){
stack.push(node.right);
}
if(node.left != null){
stack.push(node.left);
}
}
return result;
}
}
2.二叉树的中序遍历
递归法:
class Solution{
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
inorder(root, result);
return result;
}
void inorder(TreeNode root, List<Integer> result) {
if (root == null) return;
inorder(root.left, result);
result.add(root.val);
inorder(root.right, result);
}
}
迭代法:
思路:定义cur节点,把所有左节点入栈,左中节点出栈的时候,走到右节点去入栈,依次类推即 左中右
class Solution{
public List<Integer> inorder(TreeNode root){
List<Integer> result = new ArrayList<>();
if(root == null) return result;
ArrayDeque<TreeNode> stack = new ArrayDeque<>();
TreeNode cur = root;
while(cur != null || !stack.isEmpty()){
if(cur != null){
stack.push(cur);
cur = cur.left;
}else{
cur = stack.pop();
result.add(cur.val);
cur = cur.right;
}
}
return result;
}
}
3.二叉树的后序遍历
递归法:
class Solution{
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> result = new ArrayList<>();
postorder(root, result);
return result;
}
void postorder(TreeNode root, List<Integer> result) {
if (root == null) return;
postorder(root.left, result);
postorder(root.right, result);
result.add(root.val);
}
}
迭代法:
思路:前序是中左右,后序在遍历的时候 可以由前序转化,即中左右 —》 中右左 —》 反转数组 左右中即后序遍历
class Solution{
public List<Integer> post(TreeNode root){
List<Integer> result = new ArrayList<>();
if(root == null) return result;
ArrayDeque<TreeNode> stack = new ArrayDeque<>();
stack.push(root);
while(!stack.isEmpty()){
TreeNode node = stack.pop();
result.add(node.val);
if(node.left != null){
stack.push(node.left);
}
if(node.right != null){
stack.push(node.right);
}
}
Collections.reverse(result);
return result;
}
}
4.二叉树的层序遍历
给你一个二叉树,请你返回其按 层序遍历 得到的节点值。 (即逐层地,从左到右访问所有节点)。
思路:借助队列先进先出的性质,遍历一层则添加到队列中,然后出队遍历下一层
代码如下:
import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.Queue;
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> result = new ArrayList<>();
if (root == null) return result;
Deque<TreeNode> deque = new ArrayDeque<>();
deque.offer(root);
while(!deque.isEmpty()){
List<Integer> itemList = new ArrayList<>();
int len = deque.size();
while(len-- > 0){
TreeNode tmpNode = que.poll();
itemList.add(tmpNode.val);
if(tmpNode.left != null) que.offer(tmpNode.left);
if(tmpNode.right != null) que.offer(tmpNode.right);
}
resList.add(itemList);
}
return result;
}
}
5.翻转二叉树
翻转一棵二叉树。
思路:
解法一:层序遍历,遍历每一层,交换左右节点
解法二:递归前序遍历,中左右,左右交换
代码如下:
class Solution{
public TreeNode invertNode(TreeNode root){
if (root == null) return result;
Deque<TreeNode> deque = new ArrayDeque<>();
deque.offer(root);
while(!deque.isEmpty()){
int len = deque.size();
while(len-- > 0){
TreeNode node = que.poll();
swap(node);
if(node.left != null) que.offer(node.left);
if(node.right != null) que.offer(node.right);
}
}
return root;
}
void swap(TreeNode root){
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
}
//解法二:递归前序遍历,中左右,左右交换
public TreeNode invertTree(TreeNode root) {
if (root == null) {
return null;
}
invertTree(root.left);
invertTree(root.right);
swap(root);
return root;
}
}