CMSC 341 -- Fall 2003 -- Project 5

Copy this file into your directory and edit it to add your answers to the
following questions about project 5.

These questions count for 10% of your project grade.


1. (10 points) A median heap is a heap that makes it possible to find the
   median of a set of numbers in constant time.  How could you use a pair
   of heaps, one min heap and one max heap, to implement a median heap such
   that findMedian in O(1), and insert and deleteMedian are O(lgN).