Quote:
|
Originally Posted by cwl157
so how does that insert fit in with the insertSpot method that tells me where the next value goes?
|
I don't know that anyone will be able to tell you that, as no one except you knows what that function is supposed to do. It doesn't fit in with normal min-heap processing as it doesn't attempt to compare the new value with what is already in the heap.
For example, do you have to create all the intermediate nodes in your heap when you are trying to get to the right "spot", obviously they have to exist, but what value should they have? As this is your design, and you don't seem to want to change it, you need to work out what to do.