Ask you to write functions for right-threaded BSTs. You should also test your functions with driver programs as instructed in Programming Problems 28 and 29 at the end of this chapter.
Write a function to implement the right-threading algorithm for a BST given in the text.
Problem 28,
Write a recursive version of the remove 0 operation for the BST class template.
Problem 29,
Write a driver program to test the traversal function for right-threaded BSTs in Exercise 6.
Exercise 6,
For each of the lists of C++ keywords do the following:
a. Draw the BST that results when the words are inserted in the order given.
b. Perform in order, preorder, and post order traversals of the tree that results and show the sequence of words that results in each case.
new,const,typedewf,if,main,bool,float.