Question: Consider a data structure S supporting two operations: insert(S; x) and extract low(S). Here, extract low returns(and removes) a number y such that y one

Consider a data structure S supporting two operations: insert(S; x) and extract low(S). Here, extract low returns(and removes) a number y such that y one of the numbers smaller than the current median. Show how to design S such that both the operations can be done in amortized O(1) time.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!