Trace the algorithm in Exercise using the C++ keywords given in Exercise2. Show the right-threaded BST after each word is inserted.
Exercise ,
For show the threaded BST that results from right-threading the binary search tree.
The BST obtained by inserting the following C++ keywords in the order given into, short, char, bolo, void ,unsigned, long, double.