1. Creation
BinomialHeap<Key,Item> | bnh; |
2. Operations
BinomialHeapNode<Key,Item>* | insert (Key k, Item i) |
void | search (const Key&) |
void | searchItem (const Item&) |
void | remove (BinomialHeapNode<Key,Item>* n) |
void | remove (Item i) |
Item | extractMin () |
Item | get () |
BinomialHeapNode<Key,Item>* | minimum () |
Item | min () |
int | size () |
Bool | emptyQ () |
Bool | fullQ () |
Bool | memberQ (const Item&) |
Bool | sortedQ () |
void | clear () |
void | changeKey (HeapNode* node, Key k) |
void | decreaseKey (BinomialHeapNode<Key,Item>* node, Item k) |
void | merge (BinomialHeap<Key,Item>& H) |
void | scramble() |
void | deleteKey (ContainerNode* node) |
ostream& | display (ostream&) |
friend ostream& | operator<< (ostream& s, Heap<Item>& h) |
ObjectType | type () |