今天刷后序遍历非递归实现时,因为以前看过借助一个栈和队列来实现,但始终模糊不清,不知道如何写,只好自己捋了一遍,然后查了下,发现和很多人写法有差异,故放出来,欢迎指正,如有知道用栈和队列方式实现的朋友,也请赐教。
public ArrayList<Integer> postorderTraversal(TreeNode root) {
ArrayList<Integer> result = new ArrayList<>();
if(root==null){
return result;
}
TreeNode node = root;
Stack<TreeNode> stack = new Stack<>();
Stack<TreeNode> markStack = new Stack<>();
while(node!=null||!stack.isEmpty()){
while(node!=null){
stack.push(node);
node = node.left;
}
while(!markStack.isEmpty()&&markStack.peek()==stack.peek()){
markStack.pop();;
result.add(stack.pop().val);
}
if(!stack.isEmpty()){
node = stack.peek();
markStack.push(node);
node = node.right;
}
}
return result;
}