Sudo Placement[1.4] | BST Traversal

Given N elements to be inserted into Binary Search Tree. The task is to construct a binary search tree with only insert operation and finally print the elements in the postorder traversal. The BST is constructed according to the arrival order of elements.

Examples: 

Input: N elements = {8, 5, 10, 3, 4, 9, 7}
Output: 4 3 7 5 9 10 8

For the above input, the BST is: 
 8
 / \
 5 10
 / \ /
 3 7 9
 \
 4
The post-order traversal of the above BST is 4 3 7 5 9 10 8
 

Approach: The approach to solve this problem is to construct the BST using insertion method in BST. Once all the nodes are inserted, print the postorder traversal of the tree.

Below is the implementation of the above approach:  

4 3 7 5 9 10 8