<p>findMin: just look at the root node</p></li>
<li><p>insert(val): put it at correct spot, percolate up</p>
<ul>
<li><p>percolate - Repeatedly exchange node with its parent if needed</p></li>
<li><p>expecteed run time: ‚àëi=1..n 1/2^n‚àón=2</p></li>
</ul>
</li>
<li><p>deleteMin: put last leaf at root, percolate down</p>
<ul>
<li><p>Remove root (that is always the min!)</p></li>
<li><p>Put ‚Äúlast‚Äù leaf node at root</p></li>
<li><p>Repeatedly find smallest child and swap node with smallest