前言
树的前序、中序、后序遍历是常见的树检索方式,本文分享了Java实现树的前序、中序、后序遍历的代码
希望对大家有用!
一、什么是树的前序、中序、后序遍历?
先序(深度搜索遍历DFS):先顶点,再左边节点,接着右边节点
中序:先左边节点,再顶点,最后右边节点
后序:先左边节点,然后右边节点,最后为顶点
更多内容可以参考:树-树的遍历(先序、中序、后序)
树的前序遍历、中序遍历、后序遍历详解
二、具体实现代码
1.前序遍历
import java.util.*;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* public TreeNode(int val) {
* this.val = val;
* }
* }
*/
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param root TreeNode类
* @return int整型一维数组
*/
public int[] preorderTraversal (TreeNode root) {
// write code here
List<Integer> list=new ArrayList<>();
preorder(list,root);
int[] res = new int[list.size()];
for(int i = 0; i < list.size();i++){
res[i]=list.get(i);
}
return res;
}
public void preorder(List<Integer> list,TreeNode node){
if(node == null){
return ;
}
list.add(node.val);
preorder(list,node.left);
preorder(list,node.right);
}
}
2.中序遍历
import java.util.*;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* public TreeNode(int val) {
* this.val = val;
* }
* }
*/
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param root TreeNode类
* @return int整型一维数组
*/
public int[] inorderTraversal (TreeNode root) {
// write code here
List<Integer> list = new ArrayList();
inorder(list,root);
int res[] = new int[list.size()];
for(int i =0 ; i < list.size(); i++){
res[i]=list.get(i);
}
return res;
}
public void inorder(List<Integer> list,TreeNode node){
if(node == null){
return ;
}
inorder(list,node.left);
list.add(node.val);
inorder(list,node.right);
}
}
3.后序遍历
import java.util.*;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* public TreeNode(int val) {
* this.val = val;
* }
* }
*/
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param root TreeNode类
* @return int整型一维数组
*/
public int[] postorderTraversal (TreeNode root) {
// write code here
List<Integer> list=new ArrayList();
endorder(list,root);
int[] res = new int[list.size()];
for(int i = 0; i<list.size(); i++){
res[i]=list.get(i);
}
return res;
}
public void endorder(List<Integer> list, TreeNode node){
if(node == null){
return ;
}
endorder(list,node.left);
endorder(list,node.right);
list.add(node.val);
}
}