Purpose: to learn about removing a node from a binary search trees (BST)
Testing: You will be asked to show removals of all the different cases (0, 1 and 2 children) maybe involving the Root.
Interface: Use the Visual interface with the following components
Optional
Build the BST class with iterator capability. An iterator capability involves having functions
If you have this capabilty, then Display() can be a 'user function' coded in the ...Dlg class and you don't need a BST::Display function.
In class we will discuss how to build the iterator functions