CSC297.Java 2003F, Class 32: Looped Queues

Admin
* No class next Wednesday!
* Homework: Implement simple versions of binary search trees (they don't need to be balanced).
  * Remember: THe design of a BST is that there's a value in every vertex.  The left subtree contains smaller stuff.  The right subtree contains larger stuff.
  * Operations: add (adds an element); find (finds an element); delete; construct
  * To add: Keep looking and moving left or right until you run off the tree.  Add it there.
  * To remove: Get the value; Move the rightmost value in the left subtree into that place.  (A few more subtleties to play with.)
  * To find: A lot like adding, except that you stop when you find it or run off of the tree.
  * Need to create a "helper object" for each vertex in the tree
    * Stores links to left subtree and right subtree
    * Also stores current value

Overview:
* Go over Yvonne's homework.

Morals:
* Don't forget to update *all* the important variables.
  * In this case, we needed to update length in more cases
  * We also needed to update back in add (but not in get)
* Write procedures to "dump" the internals (usually for testing)
* Write interactive testing procedures
* Don't redeclare your fields within your constructors