非递归后序遍历和层序遍历的比较
1.非递归后序遍历是在在栈的基础上实现,需要理解栈的一些基础语法操作
建栈: Stack<TreeNode> stack = new Stack();
压栈(入栈):stack.push();
查看栈顶元素(不删除):stack.peek();
出栈(删除栈顶元素,返回值为它):stack.pop();
2.层序遍历是在队列的基础上实现的,同样队列的一些基础语法操作也是需要理解的
建队列:Queue<TreeNode> queue = new LinkedList<>(); //队列的背后是链表
在队列中插入元素:queue.offer();
判断队列是否为空:queue.isEmpty()
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Stack;
class TreeNode{
int value;
TreeNode left;
TreeNode right;
}
public class TREE {
//非递归后序遍历 栈
public static void postOrder(TreeNode root){
Stack<TreeNode> stack = new Stack<>();
TreeNode cur = root;
TreeNode last = null; //上一个被打印的结点
while(cur != null || !stack.isEmpty()){
while(cur != null){
cur = cur.left;
stack.push(cur);
}
TreeNode top = stack.peek(); //记录栈顶元素
if(top.right == null || top.right == last){
System.out.println(top.value);
stack.pop(); //出栈
last = top;
}else{
cur = top.right;
}
}
}
//层序遍历 队列
public static void levelOrder(TreeNode root){
if(root == null){
return;
}
Queue<TreeNode>queue = new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
TreeNode front = queue.poll();
System.out.println(front.value);
if(front.left != null){
queue.offer(front.left);
}
if(front.right != null){
queue.offer(front.right);
}
}
}
}