二叉树的后序遍历

/**
 * 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> res = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        if(root == null){
            return res;
        }
        TreeNode lastPopNode = null;

        while(!stack.isEmpty() || root != null){
            while(root != null){
                //当左右节点没有被记录时 才继续压栈
                if(lastPopNode == null || (root.right != lastPopNode && root.left != lastPopNode )){
                    stack.push(root);
                    if(root.right != null){
                        stack.push(root.right);
                    }
                    root = root.left;
                }else{
                    res.add(root.val);
                    lastPopNode = root;
                    break;
                }
            }
            if(stack.isEmpty()){
                break;
            }
            root = stack.pop();
            //左右节点均为空时,记录结果
            if(root.left == null && root.right == null){
                res.add(root.val);
                //用于判断左右节点是否被访问过
                lastPopNode = root;
                if(stack.isEmpty()){
                    break;
                }else{
                    root = stack.pop();
                }
            }
        }
        return res;
    }
}

/**
 * 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> list=new ArrayList<>();
        Stack<TreeNode> stack=new Stack<>();

        while(root!=null||(!stack.empty())){
            if(root!=null){
                stack.push(root);//把根节点放入栈中
                list.add(0,root.val);//步骤一,在index=0处插入根结点的值
                root=root.right;//步骤二,遍历右子树
            }else{
                TreeNode tem=stack.pop();
                root=tem.left;//步骤三,遍历左子树
            }
        }
        return list;
    }

    public void postorderTraversal(TreeNode root,List<Integer> res){
        if(root == null){
            return;
        }
        postorderTraversal(root.left,res);
        postorderTraversal(root.right,res);
        res.add(root.val);
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值