PRIORITY QUEUE USING AVL TREE [ c++ ]

Differences in the implement of a PriorityQueue when using a std::vector in : unsorted, sorted, and as a heap. (especially for the operation : INSERTION, EXTRACT MIN, EXTRACT MAX)

.