Write an application to show graphically the process of binary search tree insertion and any one of the following traversal using c++.
a) Binary search tree in order traversal using stack (iterative version).OR
b) Breadth First Traversal using queue.
Specifications:
The program will read maximum of ten values from user.
You have to first read values then create binary search tree showing each step by labeling root and curr pointer( if any in your code) as well as stack/ queue at each step during insert and remove operations (in traversals ) .
The code should be properly designed by using the concept of data structures (use of user defined classes like stack etc).