Heap

Question 1

How to get the parent, left child, right child?

Answer 1

Consider that the array starts at index 1:

to get the parent(int i):
return i/2 
left child:
return 2*i
right child:
return 2*i+1

Question 2

What is a heap?

Answer 2

A heap is a method to represent a binary tree in the form of an array. It can considered as a min heap or max heap.

Question 3

Heap property?

Answer 3

for every node other than the parent node, A[parent(i)] >= A[i]