Description: Mapping binary heap can be inserted, access and remove any element of complexity are O (logn) insert to provide an index value, remove the index, press delete, get and delete the smallest element to obtain the index with the index value range 0 .. MAXN-1, could not repeat, is not responsible for maintaining the index is unique, not this return please also used in graph theory mapping algorithm, the index value can be the node subscript// can change the element type, modified or replaced with more symbols comparison function
To Search:
File list (Check if you may need any files):
堆(mapped).cpp
Download