Administrative:

    Remember hw1 written part is due 5pm Thursday.  Questions yet?

    The hw1 program is available, in share/hw1/, I'll demonstrate how
    to get started using BlueJ.  It is due 9pm Tuesday next week.  It
    is relatively easy, sorry, I'll try to make later ones harder!

    Late penalty: 10pts/day (calculated fractionally), up to 3 days.
    In case of time conflicts, ask for an extension ahead of time.

    My office hours are 1-3pm MW, or by appointment, or whenever you
    can find me with free time.   I'll post these online today.

    For security reasons, ssh is only allowed to one lab machine:
    lab0z.mathcs.emory.edu (not actually in the lab, but the same
    setup).  From there you can reach any of the others.

Today I'll take some time to introduce the hw1 program, in particular
I'll give you some directions on getting started, and how to turnin.
I still need to write these directions down (in share/hw1/Notes.txt).

We have basically finished the heap/heapsort topic, today we go on to
binary search trees (BST's).  I understand most of you have at least
been introduced to this topic in CS171, maybe seeing the AVL tree as
an example balanced BST.  We'll review Sedgewick's BST notes, since
he says quite a few things you may have missed.   Our eventual aim
is to understand (and do some work with) red-black trees.

Topic: Section 3.2, Binary Search Trees (unbalanced)
   32BinarySearchTrees.pdf     (all about unbalanced BST's)
   32DemoBinarySearchTree.mov  (simple find and insert)

Next:  Section 3.3, Balanced Search Trees
   33BalancedSearchTrees.pdf   (2-3 trees, maybe not today)