min-max heap implementation

I'm trying to get the logic for the min-max heap (min is the root max is the next level and so on). I am confused about the percolate up and down aspects of the function.

the code written so far uses vector to store information.
Last edited on
Can you be more specific about your questions? Do you have code that you can post?
Topic archived. No new replies allowed.