This programming assignment is designed to:

• implement a partial Binary Search Tree (BST) container
• introduce the use of recursion in a member function
• introduce the use of Insert, Find, isEmpty and Display in the context of a BST

• an edit box for entering an integer
• a button labeled Insert
• a button labeled Find
• a button labeled isEmpty?
• a ListBox

Overview of the project:

• This should seem like a pretty easy assignment. You do NOT need to impliment a Remove() function (that will be covered in assignment #12).
• Create a class BST with members
  1. BST();
  2. void Insert(int); //DO NOT MAKE THIS A RECURSIVE FUNCTION!
     
     
  3. bool Find(int); //DO NOT MAKE THIS A RECURSIVE FUNCTION!
     
     
  4. bool isEmpty();
  5. void Display(CListBox &);
  6. Node * Root;
• Create a class/struct BST_Node with members
  1. BST_Node();
  2. BST_Node(int);
  3. Node * LC; // The Left Child pointer
  4. Node * RC; // The Right Child pointer

The Display(..) function will get called from OnButtonInsert.  It must pass the CListBox (since the ListBox belongs to the ...Dlg class and the Display(...) function is a member of the BST class.  The Display()ing activity needs to be recursive so the Display() function will need to call a recursive function named DisplayHelper(). The Display() and DisplayHelper() functions might look like the following.

void BST::Display(CListBox & listing ) 
{ 
    listing.ResetContent(); 
    DisplayHelper(listing,Root);
} 

void BST::DisplayHelper(CListBox & listing, Node * current) 
{ 
    char temp[20];                  // used to pass a value to the ListBox 
    if( current == NULL ) return;
    DisplayHelper(listing, current->LC);
		// put the integer in the 'current' node into the listbox
		// process (recur) on the right child of the current node
}