145. Post Order Traversal

这道题postorder相当于是反过来的preorder

preorder：root left right

postorder: left right root -(reverse)-> root right left

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        if(root == null){
            return new ArrayList<>();
        }
        
        Deque<TreeNode> stack1 = new ArrayDeque<>();
        Deque<Integer> stack2 = new ArrayDeque<>();
        
        stack1.addFirst(root);
        
        while(!stack1.isEmpty()){
            TreeNode temp = stack1.removeFirst();
            stack2.addFirst(temp.val);
            if(temp.left != null){
                stack1.addFirst(temp.left);
            }
            if(temp.right != null){
                stack1.addFirst(temp.right);
            }
        }
        
        return new ArrayList<Integer>(stack2);
    }
}

 

转载于:https://my.oschina.net/u/3457852/blog/1538990