Which of the following data structures can be efficiently implemented using height balanced binary search tree?

• A. sets
• B. priority queue
• C. heap
• D. both sets and priority queue