heap

Documentation

Index

• type MinHeap
  • func (h *MinHeap) InsertNode(node ...int) *MinHeap
  • func (h *MinHeap) LeftChildIndex(parentNodeIndex int) int
  • func (h *MinHeap) ParentIndex(childIndex int) int
  • func (h *MinHeap) RightChildIndex(parentNodeIndex int) int
  • func (h *MinHeap) String() string

Types

type MinHeap

type MinHeap struct {
	// contains filtered or unexported fields
}

A basic int heap Accepts no size as we dynamically resize the heap in a slice fashion. Otherwise it is an ordinary MinHeap. Example:

	1
  5   3
9  6 8

Arr form: 1 3 6 5 9 8

func (*MinHeap) InsertNode

func (h *MinHeap) InsertNode(node ...int) *MinHeap

Insert a node into the heap

func (*MinHeap) LeftChildIndex

func (h *MinHeap) LeftChildIndex(parentNodeIndex int) int

Get left child index for a given node index

func (*MinHeap) ParentIndex

func (h *MinHeap) ParentIndex(childIndex int) int

Gets parent index for a given node

func (*MinHeap) RightChildIndex

func (h *MinHeap) RightChildIndex(parentNodeIndex int) int

Get right child index for a given node index

func (*MinHeap) String

func (h *MinHeap) String() string