This section prescribes additional exercise with the recursive and iterative handling of a binary search tree.
Adding to the Binary Search Tree Recursively
Add implementations to recursively add to the binary search tree. The public addRecursively method should examine the tree's root, placing the new addition there if the root is zero; otherwise,addRecursively will call the private method addRecursively, passing it the non-zero root of the tree. The recursive method will compare the new addition's data to that located at the current root. If the data is less and the subsequent left pointer is zero, the new addition can be stored there; otherwise, the function calls itself recursively, passing the non-zero left pointer to itself. Data in the new addition greater than that in the current root is handled similarly with the right pointer.
Displaying the Binary Search Tree Iteratively
Add the implementation to iteratively write the binary search tree. The iteration will move down the tree, following successive left pointers. The first node with zero for a left pointer may be written, as there can be no data which comes before it. The iteration which moves down the tree will need to stack each current pointer so that it may unwind the downward traversal of the tree. Use theTemplateNode, TemplateList and TemplateStack implementations from the previous homework for this purpose. Starting with a current pointer initialized to the root of the tree, replace the current pointer with each non-zero left pointer encountered; push current on the stack before each replacement. When a left pointer of zero is encountered, display that node's data and move to the right. When a right pointer of zero is assigned to current, pop to move back up the tree, write a node, then move right again. Become familiar with this behavior in a diagram before coding.
Destroying the Binary Search Tree
Implement a recursive erase method. Add the following prototypes to the tree's class definition.
The bodies of these methods will be identical in form to those for writing recursively.
Add the following code to the else clause in the main function. Note the use of the recursive erase and add methods and the iterative write.
cout<< "Press to continue...\n";
cout<< "Recursive Tree Listing After Erase:" <
infile.clear(); // restore stream state so I/O may proceed
infile.seekg (0); // seek "get" to file start (byte #0)
customerTree.addRecursively (new node(infile)); // recursive add
cout<< "Iterative Listing of Recursive Additions\n";
Note that one of the erase methods could be called by the destructor to perform its function as well.
Test the algorithms thoroughly by modifying the data file several times.