Suppose we extend binomial queues to allow at most two trees of the same heightper
Chapter 6, Problem 6.36(choose chapter or problem)
Suppose we extend binomial queues to allow at most two trees of the same heightper structure. Can we obtain O(1) worst-case time for insertion while retainingO(logN) for the other operations?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer