A self – balancing binary search tree can be used to implement ________

• A. Priority queue
• B. Hash table
• C. Heap sort
• D. Priority queue and Heap sort