Design a data structure that can perform the given operations in the stated worst-case running time:
Insert: O(lg n)Maximum: O(1)Minimum: O(1)Extract-max: O(lg n)Extract-min: O(lg n)
共有 2 条评论,登录后可见