Introduction - If you have any usage issues, please Google them yourself
// BinaryHeap class
//
// CONSTRUCTION: with an optional capacity (that defaults to 100)
//
//******************PUBLIC OPERATIONS*********************
// void insert( x ) --> Insert x
// deleteMin( minItem ) --> Remove (and optionally return) smallest item
// Comparable findMin( ) --> Return smallest item
// bool isEmpty( ) --> Return true if empty else false
// void makeEmpty( ) --> Remove all items