• C

Double-sided priority Queues using min-max heaps

How are the basic operations on a min-max heap implemented? They are insert(), deletemin(), deletemax(), findmin(), and findmax().
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

ksdg025Author Commented:

A queue must be defined as:

PriorityQueue {
     int Size;
     int Maxsize;
     int *Elements;

Where Size is the current size of the heap, MaxSize is its's capacity, *Elements is a pointer to an array that con hold Maxsize integers.

these are pretty staright forward . what do u want actually ???do u want implementation ???
a min-max heap is one where the alternate levels are max and min of all their descendants... here's a url that explains (somewhat) the percolate procedures... if u find it confusing, pls post and i'll elab... u need percolation to use a heap and then insertion, deletion and extraction of min/max become v. easy:


Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
ksdg025Author Commented:
The web page did provide somewhat of a general overview of the subject and it's implementation and it was enough to get me started. Thanks!
u're most welcome :)
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today

From novice to tech pro — start learning today.