Lecture Notes on 10 Apr 2013

* Topics for the Quiz on Friday (12 Apr 2013)

* Given a hash table hash a set of numbers into that table using
  (1) Linear probing
  (2) Quadratic probing
  (3) Double hashing

* Given a set of numbers create a min-heap and max heap out of them.

* Given an index give its parent's index and the indices of its left 
  and right child.

* Show what the heap will look like after several insertions and
  deletions. Use trickle-up and trickle-down.

* Create a binary search tree with a set of numbers. Give the height
  and balance factor of each node.

* Create an AVL tree. Try an extreme case of 10, 20, 30, 40, 50, 60, 
  70, 80, 90, 100, balancing as you insert.