A complete binary tree T is a min-heap if:

• T = {} or
• T = {r, T_L, T_R}, where r is less than the roots of {T_L, T_R} and {T_L, T_R} are min-heaps

We can find parent of the node by multiplying //