Which data structure is used to implement priority scheduling?
Show Hint
Priority Queues are most commonly implemented using a Heap data structure (Binary Heap), which allows for efficient $O(\log n)$ insertion and deletion of the maximum/minimum element.