145. 二叉树的后序遍历

public List<Integer> postorderTraversal1(TreeNode root) {
        if (root == null) {
            return Collections.emptyList();
        }
        List<Integer> res = new ArrayList<>();
        add(root, res);
        return res;
    }

    public void add(TreeNode node, List<Integer> list) {
        if (node == null) {
            return;
        }
        if (node.left != null) {
            add(node.left, list);
        }
        if (node.right != null) {
            add(node.right, list);
        }
        list.add(node.val);
    }

/**
     * 二叉树后续遍历
     *
     * @param root
     * @return
     */
    public List<Integer> postorderTraversal(TreeNode root) {
        if (root == null) {
            return Collections.emptyList();
        }
        int size = 1;
        Deque<TreeNode> stack1 = new LinkedList<>();
        Deque<TreeNode> stack2 = new LinkedList<>();

        stack1.push(root);
        while (!stack1.isEmpty()) {
            size++;
            TreeNode pop = stack1.pop();
            stack2.push(pop);
            if (pop.left != null) {
                stack1.push(pop.left);
            }
            if (pop.right != null) {
                stack1.push(pop.right);
            }
        }
        List<Integer> res = new ArrayList<>(size);
        while (!stack2.isEmpty()) {
            res.add(stack2.pop().val);
        }
        return res;
    }