-- import "github.com/vedhavyas/min-binary-heap"
type Heap struct {
}
Heap represents Minimum Binary Heap
func New() *Heap
New returns a new Minimum Binary Heap data structure
func (h *Heap) Len() int
Len returns the total size of Heap
func (h *Heap) Pop() interface{}
Pop returns the value with lowest priority if multiple values with same priority exists, will pop one of them
func (h *Heap) Push(priority int, key interface{})
Push takes a key and its priority and adds to the heap