import java.util.*;
/*二叉树遍历测试,有一点难,前序与后序可以对照着看*/
public class Solution3 {
/*二叉树前序遍历 根左右*/
public static ArrayList<Integer> testPre(TreeNode root){
ArrayList<Integer> list=new ArrayList<Integer>();
Stack<TreeNode> stack=new Stack<TreeNode>();
if(root==null){
return list;
}
stack.push(root);
while (!stack.empty()){
TreeNode node=stack.pop();
list.add(node.val);
if(node.right!=null){
stack.push(node.right);
}
if(node.left!=null){
stack.push(node.left);
}
}
return list;
}
/*后序遍历 左右根 可以换算成 根右左,利用stack先进后出变成左右根。*/
public static ArrayList<Integer> testLast(TreeNode root){
ArrayList<Integer> list=new ArrayList<Integer>();
Stack<TreeNode> stack=new Stack<TreeNode>();
Stack<Integer> stack1=new Stack<Integer>();
if(root==null){
return list;
}
stack.push(root);
while (!stack.empty()){
TreeNode node=stack.pop();
stack1.push(node.val);
if(node.left!=null){
stack.push(node.left);
}
if(node.right!=null){
stack.push(node.right);
}
}
while (!stack1.empty()){
int a=stack1.pop();
list.add(a);
}
return list;
}
/*中序二叉树遍历 左根右*/
public static ArrayList<Integer> testMid(TreeNode root){
ArrayList<Integer> list=new ArrayList<Integer>();
Stack<TreeNode> stack=new Stack<TreeNode>();
if(root==null){
return list;
}
//边界条件,全部遍历完才能结束。
while (!stack.empty()||root!=null){
if (root != null) {
stack.push(root);
root = root.left;
}else {
TreeNode node = stack.pop();
list.add(node.val);
root = node.right;
}
}
return list;
}
/*层级遍历*/
public static ArrayList<Integer> testFloor(TreeNode root) {
ArrayList<Integer> list = new ArrayList<Integer>();
Queue<TreeNode> queue=new ArrayDeque<TreeNode>();
if(root==null){
return list;
}
queue.offer(root);
while (!queue.isEmpty()){
TreeNode node=queue.poll();
list.add(node.val);
if (node.left!=null){
queue.offer(node.left);
}
if (node.right!=null){
queue.offer(node.right);
}
}
return list;
}
public static void main(String[] args) {
TreeNode tree=new TreeNode(1);
tree.left=new TreeNode(2);
tree.right=new TreeNode(3);
tree.left.left=new TreeNode(4);
tree.left.right=new TreeNode(5);
tree.right.left=new TreeNode(6);
tree.right.right=new TreeNode(7);
//遍历测试
ArrayList<Integer> l=testPre(tree);
ArrayList<Integer> l1=testMid(tree);
ArrayList<Integer> l2=testLast(tree);
ArrayList<Integer> l3=testFloor(tree);
for (Integer i : l1) {
System.out.println(i);
}
}
}
1