LeetCode -- Binary Tree Postorder Traversalt

Binary Tree Postorder Traversal

recursion:

public class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<Integer>();
        postorderTraversalHelper(root, list);
        return list;
    }
    
    public void postorderTraversalHelper(TreeNode root, List<Integer> list) {
        if(root == null) {
            return;
        }
        
        postorderTraversalHelper(root.left, list);
        postorderTraversalHelper(root.right, list);
        list.add(root.val);
    }
}

stack, 这里要说两句，postorder相比preorder和inorder要稍微复杂，在某个node的子树入栈时，要将该node的这个子树位置null，这样，在遍历回去的时候不会再访问一次。

public class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<Integer>();
        if(root == null) {
            return list;
        }
        
        Stack<TreeNode> stack = new Stack<TreeNode>();
        stack.push(root);
        while(!stack.isEmpty()) {
            TreeNode node = stack.peek();
            //left child is not null
            if(node.left != null) {
                TreeNode tmp = node.left;
                stack.push(tmp);
                node.left = null; //set left child to null
                node = tmp;
            }
            //left child is null, but right is not
            if(node.left == null && node.right != null) {
                TreeNode tmp = node.right;
                stack.push(node.right);
                node.right = null; //set the right to null
                node = tmp;
            }
            //node is leaf, add to list
            if(node.left == null && node.right == null) {
                list.add(stack.pop().val);
            }
        }
        return list;
    }
}