A issue In BinaryHeap

[aqhan]

In BinaryHeap，a function called Push

func (heap *Heap[T]) Push(values ...T) {
	if len(values) == 1 {
		heap.list.Add(values[0])
		heap.bubbleUp()
	} else {
		// Reference: https://en.wikipedia.org/wiki/Binary_heap#Building_a_heap
		for _, value := range values {
			heap.list.Add(value)
		}
		size := heap.list.Size()/2 + 1
		for i := size; i >= 0; i-- {
			heap.bubbleDownIndex(i)
		}
	}
}

In size_ := heap.list.Size()/2 + 1
Adjusting the code to size_ := heap.list.Size()/2 - 1 would be a more suitable approach.

We just need internal node to heapify. For Push(3, 2, 1), we just need index 0 to heapify, for Push (7, 6, 5, 4, 3, 2, 1), index 0, 1, 2 should be bubbleDown instead of index for 0 to 4.