一、二叉树的前序遍历
题目:给你二叉树的根节点 root ,返回它节点值的前序遍历。
https://leetcode-cn.com/problems/binary-tree-preorder-traversal/
示例1:
输入:root = [1,null,2,3]
输出:[1,2,3]
示例2:
输入:root = []
输出:[]
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;
}
}
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
//如果root为空,则返回空list
if(root==null) {
return list;
}
leves(root,list);
return list;
}
public void leves(TreeNode root,List<Integer> list) {
//如果节点为空不做处理
if(root==null) {
return;
}
//root 的节点值
list.add(root.val);
//遍历左子树
leves(root.left,list);
//遍历右子树
leves(root.right,list);
}
二、二叉树的中序遍历
题目:给定一个二叉树的根节点 root ,返回它的中序遍历。
https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
示例1:
输入:root = [1,null,2,3]
输出:[1,3,2]
示例2:
输入:root = []
输出:[]
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;
}
}
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
//如果root为空,则返回空list
if(root==null) {
return list;
}
leves(root,list);
return list;
}
public void leves(TreeNode root,List<Integer> list) {
//如果节点为空不做处理
if(root==null) {
return;
}
//遍历左子树
leves(root.left,list);
//root 的节点值
list.add(root.val);
//遍历右子树
leves(root.right,list);
}
三、后序遍历
题目:给你一棵二叉树的根节点 root ,返回其节点值的后序遍历 。
示例1:
输入:root = [1,null,2,3]
输出:[3,2,1]
示例2:
输入:root = []
输出:[]
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;
}
}
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
//如果root为空,则返回空list
if(root==null) {
return list;
}
leves(root,list);
return list;
}
public void leves(TreeNode root,List<Integer> list) {
//如果节点为空不做处理
if(root==null) {
return;
}
//遍历左子树
leves(root.left,list);
//遍历右子树
leves(root.right,list);
//root 的节点值
list.add(root.val);
}
四、层次遍历
题目:给你二叉树的根节点 root ,返回其节点值的层序遍历 。 (即逐层地,从左到右访问所有节点)。
https://leetcode-cn.com/problems/binary-tree-level-order-traversal/
示例1:
输入:root = [3,9,20,null,null,15,7]
输出:[[3],[9,20],[15,7]]
示例2:
输入:root = [1]
输出:[[1]]
示例3:
输入:root = []
输出:[]
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;
}
}
List<List<Integer>> list = new ArrayList<>();
public List<List<Integer>> levelOrder(TreeNode root) {
if(root==null) {
return list;
}
dns(root,0);
return list;
}
public void dns(TreeNode root,int level) {
if(root==null) {
return;
}
//当list的长度等于当前层级时才add,因为左右子树不需要多次add
if(list.size()==level) {
list.add(new ArrayList<>());
}
//获取当前level的list<Integer>,然后add节点值
list.get(level).add(root.val);
dns(root.left,level+1);
dns(root.right,level+1);
}