Due: Nov 28??

Points: 5 points, and then possibly another 5 points?

Data structures!!!

Put files in ~/HW/lab17/
Note - you are working in pairs but should both have all files related to the assignment.  

You will work in pairs to study a data structure we have not looked at in
class, create some slides/notes on it, explain the basic algorithms (insert,
lookup, delete) with some examples and say what the overall running time
is.

Note - you will need to really understand these pretty well to keep the
presentations reasonably short.  I am hoping 15 minutes per presentation.

And note - you will need to come present to me in my office (very informally)
before your presentation time comes up.  I will give some pointers on what to
say to the class, and make sure you are properly understanding the data structures.

Your assignments are as follows - 
   cs20200, cs20201 - skip list
   cs20202, cs20203 - trie
   cs20204, cs20205 - suffix tree
   cs20206, cs20207 - AVL tree
   cs20208, cs20209 - B tree
   cs20210, cs20211 - heap
   cs20213, cs20214, cs20215 - disjoint set union find

Create a README.txt in your lab17 directory which says where your slides and/or
notes are.

Presentation schedule - you'll present your data structures to the class, and
we may include some of them on the last exams.
 Nov 28 - none
 Nov 29 - heap, AVL tree
 Nov 30 - none
 Dec 1  - none
  .
 Dec 5 - trie, skip list
 Dec 6 - B tree, suffix tree
 Dec 7 - disjoint set, union find
 Dec 8 -