Postorder Tree Traversal

Postorder visits nodes in this order: Left → Right → Root.

Step: 0/0 · Output size: 0 · Speed:
Binary tree
Traversal = Postorder
Rule = Left → Right → Root
Phase = Idle
Traversal output
Left → Right → Root