p>in an array - this is faster than pointers</p>
<ul>
<li><p>left child: 2*i</p></li>
<li><p>right child: (2*i)+1</p></li>
<li><p>parent: floor(i/2)</p></li>
<li><p>pointers need more space, are slower</p></li>
<li><p>multiplying, dividing by 2 are very fast</p></li>
</ul>
</li>
</ul>
</li>
<li><p>Heap ordering property: For every non-root node X, the key in the parent of X is less than (or equal to) the key in X. Thus, the tree is partially ordered.</p></li>
</ol>
</li>
<li><p>Heap operations</p>
<ul>
<li>