CS 153 Data Structures I
Program #10
Binary Search Tree - part 1

Due Date: November 2, 2000, during your teams scheduled time.  If you would Like to demo your program before Thursday, you can do so by scheduling an appointment with a TA.

Emphasis:

Discussion:  The BST for this assignment should be as simple and straight forward as possible.  Program #11 will expand/enhance on this simple beginning

Program Requirements:

  • Place buttons on your GUI to test insert, find and print/display.
  • The following are the required public functions:
  • void Insert( int arg);        //    place a new Node into the tree
  • bool Find( int arg)const;    //    search for a Node's data that =s arg
  • void Display(CListBox & m_DisplayTree);    // perform/display an InOrder traversal of the tree
  • The following is a required private function:
  • void HelpDisplay(CListBox & a_box, Bnode * current);    // This routine does all the display work
  •  Do NOT make the ...Dlg class a friend of your BST class
    • Make sure you have preconditions, post conditions and a one-line description of your program with every function prototype. (in the header file!)
    Make sure you comment variables which are not self explanatory.
    Make sure you comment logical blocks of code.
    Don't comment every line of your code.