迭代法后序遍历
首先声明一个栈 stack
- 若root有左子树,root入栈,root=root.left,直到root为空,弹出栈顶元素并将其赋值给root
- 若root没有右子树或右子树已经被访问,则访问root节点,用pre记录root,然后root赋值null
(注意:只有访问root节点时才更新pre节点) - 若root有右子树,则root入栈,root=root.right
/**
* Definition for a binary tree node.
* 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;
* }
* }
*/
class Solution {
public List<Integer> postorderTraversal(TreeNode root) {
Stack<TreeNode> stack = new Stack<>();
List<Integer> res = new ArrayList<>();
TreeNode pre=null;
TreeNode cur=root;
while(cur!=null || !stack.empty()){
//一直向左
while(cur!=null){
stack.push(cur);
cur=cur.left;
}
//cur此时一定是null
cur = stack.pop();
//看是否有右子树
if(cur.right==null || cur.right==pre){
//没有的话 直接访问根节点
res.add(cur.val);
pre=cur;
cur=null;
}else{
//有的话,继续走右边
stack.push(cur);
cur=cur.right;
}
}
return res;
}
}