Best Operation
- Trace the best operation of Priority Queue with Binary Heap implementation.
As stated earlier, the "best" element is always at the root of a binary heap implementation of PriorityQueue ADT.
Therefore best() is $\Omicron(1)$ operation returning the value stored at root.