Loading…
Loading…
Visits Left → Right → Node. Children are processed before their parent — handy for deleting or evaluating a tree.
Postorder: Left → Right → Node.
Output: []
1void postorder(Node node, List<Integer> out) {2 if (node == null) return;3 postorder(node.left, out);4 postorder(node.right, out);5 out.add(node.val);6}