Design a Data Structure that can Insert A number, Search a number, Delete a number and also find the kth largest element. However, all of these operations must be completed in O(log N) time. How would you proceed?
Comments (4)
Design a Data Structure that can Insert A number, Search a number, Delete a number and also find the kth largest element. However, all of these operations must be completed in O(log N) time. How would you proceed?