8 A min-max heap is a data structure that supports both deleteMin and deleteMax
Chapter 6, Problem 6.18(choose chapter or problem)
8 A min-max heap is a data structure that supports both deleteMin and deleteMax inO(logN) per operation. The structure is identical to a binary heap, but the heaporderproperty is that for any node, X, at even depth, the element stored at X issmaller than the parent but larger than the grandparent (where this makes sense),and for any node X at odd depth, the element stored at X is larger than the parentbut smaller than the grandparent. See Figure 6.57.a. How do we find the minimum and maximum elements?b. Give an algorithm to insert a new node into the min-max heap.c. Give an algorithm to perform deleteMin and deleteMax. d. Can you build a min-max heap in linear time?e. Suppose we would like to support deleteMin, deleteMax, and merge. Propose adata structure to support all operations in O(logN) time.
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