Walk this tree in postorder order: both subtrees first, then the node.
A binary search tree with 7 nodes. Walking it in postorder order, which visits both subtrees first, then the node.
20 is the deepest node on the far left, so it finishes first.
Visiting 20, number 1 of 7. The order so far is 20.
40 is a leaf, so there is nothing below it to do first.
Visiting 40, number 2 of 7. The order so far is 20, 40.
Both of 30's subtrees are finished, so 30 can be written down.
Visiting 30, number 3 of 7. The order so far is 20, 40, 30.
60 is a leaf, so there is nothing below it to do first.
Visiting 60, number 4 of 7. The order so far is 20, 40, 30, 60.
80 is a leaf, so there is nothing below it to do first.
Visiting 80, number 5 of 7. The order so far is 20, 40, 30, 60, 80.
Both of 70's subtrees are finished, so 70 can be written down.
Visiting 70, number 6 of 7. The order so far is 20, 40, 30, 60, 80, 70.
Both of 50's subtrees are finished, so 50 can be written down. That is the last one.
Visiting 50, number 7 of 7. The order so far is 20, 40, 30, 60, 80, 70, 50.
The postorder walk is 20, 40, 30, 60, 80, 70, 50.
The postorder traversal visited 20, 40, 30, 60, 80, 70, 50.