Heap Data Structure

[jaden403]

If I were to implement a heap constructed of integer values, does it matter that the root is not the smallest value? In my algorithm book it always shows the root being the smallest value given. But the Wiki entry shows the root as being the largest value.

[Narue]

>does it matter that the root is not the smallest value?
If you designed it to be then yes, because that's a bug in your implementation. But as you describe the problem, your book is showing a min heap and the wiki article is showing a max heap. Both are variations of the heap priority property.