145.二叉树的后序遍历_135472后序遍历-CSDN博客

本文链接：https://blog.csdn.net/weixin_40578464/article/details/110548705

题目：

在这里插入图片描述

知识提要：

后序遍历的规则是
若节点为空，则空操作返回；
否则先后序遍历左子树
然后后序遍历右子数
最后访问根节点

代码：

递归和前/中序遍历类似，迭代的则需要跟前一个节点比较来避免再次进入右子树

/**
 * 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) {
        List<Integer> ans = new ArrayList<Integer>();
        Stack<TreeNode> stack = new Stack<TreeNode>();
        TreeNode node = root;
        TreeNode pre_node = null;
        while(!stack.isEmpty() || node != null){
            while(node != null){//把左子树走完
                stack.push(node);
                node = node.left;
            }
            node = stack.peek();
            if(node.right == null || node.right == pre_node){//第一个条件是为了处理没有右子树的节点,第二个是为了处理根节点
                ans.add(node.val);
                stack.pop();
                pre_node = node;
                node = null;//避免再去走左子树
                }
            else{
                node = node.right;
            }

        }
        return ans;
    }
}

//递归
class Solution1 {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> ans = new ArrayList<Integer>();
        postorder(root,ans);
        return ans;
    }
    public void postorder(TreeNode node,List list){
        if(node == null)
            return;
        postorder(node.left,list);
        postorder(node.right,list);
        list.add(node.val);
    }
}