The root value is at arr[0]

The below table summarizes how the node and its children are stored in an array.

Node index	Left child Index	Right Child Index
i	2*i+1	2*i+2

If the child is at index i, then its parent index can be found using the below formula.

Child’s Index	Parent’s Index
i	(i-1)/2

Operations Associated with Min Heap:

Insert()
Heapify()
getMin()
ExtractMin()
Delete()
Decreasekey()

Let’s see how these operations are done Using Min Heap.

Note: The Binary heap should always be a complete binary tree and should satisfy the corresponding heap property (Min / Max). If any of the two conditions are disturbed we should make necessary modifications in a heap to satisfy the two conditions.

Insert():

Insert operation inserts a new key in the Binary Heap.

Steps Followed for inserting the key in Binary Heap:

First Insert the key at the first vacant position from the left on the last level of the heap. IF the last level is completely filled, then insert the key as the left-most element in the next level.
Inserting a new key at the first vacant position in the last level preserves the Complete binary tree property, The Min heap property may get affected we need to check for it.
If the inserted key parent is less than the key, then the Min heap property is also not violated.
If the parent is greater than the inserted key value, then swap the values. Now the heap property may get violated at the parent node. So repeat the same process until the heap property is satisfied.
Inserting an element takes O(logN) Time Complexity. Below shows the animation of how -1 is inserted into a Binary heap by following above described steps.