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

The above asked question is from Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I

The question was asked by my school principal while I was bunking the class.