单项选择题
Which of the following data structures is used to implement the priority queue's insert, getMax, and delMax interfaces to achieve O(lgn) time complexity?使用以下哪种数据结构实现优先级队列的insert, getMax, delMax接口均可达到O(lgn)的时间复杂度?
- 未答复
A.vector向量
B.ordered vector有序向量
C.Hash table散列表
D.Balanced binary search tree平衡二叉搜索树