PostOrder Traversal in Binary Search Tree
In this lesson, we will cover the third and last traversal strategy for a Binary Search Tree—PostOrder Traversal—and implement it in code by using an example.
We'll cover the following
Postorder Traversal
In this type, the elements are traversed in a “leftrightroot” order: We first visit the left child node, then the right child, and then comes the turn of root/parent node.
Follow the steps below to perform PostOrder Traversal, starting from the root node:

Traverse the left subtree of currentNode, recursively using
PostOrder()
function. 
Traverse the right subtree of currentNode, recursively using
PostOrder()
function. 
Visit current node and print its value.
Level up your interview prep. Join Educative to access 70+ handson prep courses.