PostOrder Traversal
In this lesson, we will cover PostOrder Traversal in a Binary Search Tree and implement it in C++
We'll cover the following
Introduction #
In postorder traversal, the elements are traversed in the “leftrightroot” order. We first visit the left child, then the right child, and then finally the root/parent node. Here is a highlevel description of the postorder traversal algorithm,

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