145. Binary Tree Postorder Traversal

Given the root of a binary tree, return the postorder traversal of its nodes’ values.

1
2
3
4
Example 1:

Input: root = [1,null,2,3]
Output: [3,2,1]

ex1

1
2
3
4
Example 2:

Input: root = []
Output: []

1
2
3
4
Example 3:

Input: root = [1]
Output: [1]

1
2
3
4
Example 4:

Input: root = [1,2]
Output: [2,1]

ex4

1
2
3
4
Example 5:

Input: root = [1,null,2]
Output: [2,1]

ex5

Constraints:

The number of the nodes in the tree is in the range [0, 100].
-100 <= Node.val <= 100

Follow up:

Recursive solution is trivial, could you do it iteratively?

Jamboard

jam1

jam2

Solution

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/**
 * 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<>();
        List<TreeNode> s = new ArrayList<>();
        TreeNode curr = root;
        TreeNode lastVisited = null;
        while (curr != null || !s.isEmpty()) {
            if (curr != null) {
                s.add(curr);
                curr = curr.left;
            } else {
                TreeNode peek = s.get(s.size() - 1);
                if (peek.right != null && peek.right != lastVisited) {
                    curr = peek.right;
                } else {
                    res.add(peek.val);
                    lastVisited = s.remove(s.size() - 1);
                }
            }
        }
        return res;
    }
    
    public List<Integer> postorderTraversal3(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        List<TreeNode> s = new ArrayList<>();
        if (root != null) {
            s.add(root);
        }
        while (!s.isEmpty()) {
            TreeNode node = s.remove(s.size() - 1);
            res.add(0, node.val);
            if (node.left != null) {
                s.add(node.left);
            }
            if (node.right != null) {
                s.add(node.right);
            }
        }
        return res;
    }
    
    public List<Integer> postorderTraversal2(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        visit(root, res);
        return res;
    }
    
    void visit(TreeNode node, List<Integer> res) {
        if (node == null) return;
        visit(node.left, res);
        visit(node.right, res);
        res.add(node.val);
    }
}

Jamboard#

Solution#

Jamboard

Solution