Published Aug 10, 2022
Contribute to Docs
Postorder traversal is a depth-first search algorithm for a binary search tree that first traverses the left subtree, then the right subtree, and then the root. Its primary use is deleting the tree.
The postorder algorithm can be described as follows:
Function Postorder(tree) return Postorder(left-subtree) + Postorder(right-subtree) + root
For the following binary search tree:
Postorder traversal provides the nodes in the following order:
Looking to contribute?
- Learn more about how to get involved.
- Edit this page on GitHub to fix an error or make an improvement.
- Submit feedback to let us know how we can improve Docs.
Learn More on Codecademy
Computer ScienceLooking for an introduction to the theory behind programming? Master Python while learning data structures, algorithms, and more!
Includes 6 Courses
With Professional Certification