Week 13 Notes for CS 2500 -- Spring 2000
(this is draft material)

* Take roll 

* Schedule Highlights
  + Last quiz on the last day -- May 22.

* I have started testing the Program #4's.

* Program #5 has been assigned.

* Grades have gone out on program #3.  Check your e-mail.  Also
  check the posted grades here:

  http://shalim.csustan.edu/~john/Classes/CS2500_Programming_II/grades

  If your "Grand AVG" is 0.0 it means there is a problem with
  that you should discuss with me during office hours: MWF 1-2;
  Tu-Th 11:30-12:30, or by appt.

* Pass back Quiz #2  to those who did not get it yet.  Check my arithmetic

* Any questions about program #5?

* We discuss binary search trees
 + The defining properties of a binary search tree
   - a binary tree is empty or consists of a node with two
     subtree's, each of which is a binary tree.
   - in a binary search tree each node has a key value.  All
     left descendants of a node have smaller keys and all right
     descendants have larger (or equal) keys.

     For example, this is *not* a BST:

                      32
                    /    \
		   /      \
		 16        48
	        /  \      /  \
	       /    \    /    \
              8     40  3      51

     The example above is interesting because each left *child* is
     less than it's parent, and each right *child* is greater
     than it's parent, but *still* that is not enough to make
     the tree a BST.  Note that 40 is in the left subtree of
     32 and 3 is in the right subtree of 32.  These things are
     not allowed in a BST.

     On the other hand, this *is* a BST:

                      32
                    /    \
		   /      \
		 16        48
	        /  \      /  \
	       /    \    /    \
              8      20 36    51

 + BST's are "uniformly not bad"
 + How does search work?
 + How does insertion work?
 + How does deletion work?
 + How do traversals work?
 + What does the code look like?
 + What are we supposed to be doing in assignment #5?
   - There two new help files in the Asg05 directory:
     ^ test_Plan_Ideas
     ^ driver_Sample_Code.cpp

 + In quiz problems -- remember we replace with the leftmost
   node in the right subtree when deleting a node with two
   children.
 + In quiz problems, remember that our text counts levels in
   the tree starting at level ONE (not zero).  The root is at
   level one.

 + I sent back reports on how the testing of program #4 went.
   This gives you some feedback, but not a grade.  I still have
   to look over the designs of the programs and assign points.
   
==================================================
FRIDAY
==================================================
* AT 10:55 LAST 13 MINUTES OF CLASS: IDEA FORMS!!
* AT 10:55 LAST 13 MINUTES OF CLASS: IDEA FORMS!!
* AT 10:55 LAST 13 MINUTES OF CLASS: IDEA FORMS!!
* AT 10:55 LAST 13 MINUTES OF CLASS: IDEA FORMS!!
* AT 10:55 LAST 13 MINUTES OF CLASS: IDEA FORMS!!
* AT 10:55 LAST 13 MINUTES OF CLASS: IDEA FORMS!!