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; // Empty subtree, stop3 postorder(node.left, out); // Traverse left subtree4 postorder(node.right, out); // Traverse right subtree5 out.add(node.val); // Visit node last6}