</p></li>
</ul>
</li>
<li><p>Priority Queue - Binary Heap is always used for Priority Queue</p>
<ol class="arabic simple">
<li><p>insert</p>
<ul>
<li><p>inserts with a priority</p></li>
</ul>
</li>
<li><p>findMin</p>
<ul>
<li><p>finds the minimum element</p></li>
</ul>
</li>
<li><p>deleteMin</p>
<ul>
<li><p>finds, returns, and removes minimum element</p></li>
</ul>
</li>
</ol>
</li>
<li><p>perfect (or complete) binary tree - binary tree with all leaf nodes at the same depth; all internal nodes have 2 childr