Design a data structure to support the following operations:
• insert(x,T) - Insert item x into the set T.
• delete(k,T) - Delete the kth smallest element from T.
• member(x,T) - Return true iff x ∈ T. All operations must take O(log n) time on an n-element set.