非递归（迭代）实现二叉树的后序遍历

/**
 * 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 {
        Stack<TreeNode> stack1 = new Stack<>();
        Stack<TreeNode> stack2 = new Stack<>();
        ArrayList<Integer> list = new ArrayList<>();

        public List<Integer> postorderTraversal(TreeNode root) {
            if (root == null) return list;
            stack1.push(root);  //根节点入栈
            while (!stack1.isEmpty()){
                TreeNode node = stack1.pop();
                stack2.push(node);          //根节点入栈
                if (node.left != null){
                    stack1.push(node.left);
                }
                if (node.right != null){
                    stack1.push(node.right);
                }

            }
            while( !stack2.isEmpty()){
                list.add(stack2.pop().val);
            }

            return list;
        }
    }

详细解析点此进入