二叉树的后序遍历

/**
 * 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);
    }
}