Trees· 10 min
Post-order Traversal
Left → Right → Root — useful for deletion
Setup
Step 1 / 30
Current step
1 / 30Start at the root — call postorder(50)
Step log
7 nodes · depth 3 · drag to pan, scroll to zoom
Current / on path
Visited
Just inserted
Found
postorder_traversal.java
1void postorder(Node node) {2 if (node == null) return;3 postorder(node.left);4 postorder(node.right);5 visit(node);6}● Java
Call stack1 frame
postorder(50)active
Traversal output0 / 7
nothing visited yet
Post-order Traversal
Post-order traversal visits every node in a specific order. Post-order visits children before the parent — useful for deleting a tree.
Nodes
7
Mode
traversal
Time (avg)
O(log n)
Time (worst)
O(n)
50307020406080