refix code - build tree</p></li>
<li><p>read in one bit at a time and follow tree</p></li>
</ol>
</li>
</ul>
</li>
<li><p>ASCII characters - 8 bits, 2^7 = 128 characters</p>
<ul>
<li><p>cost - total number of bits</p></li>
<li><p>‚Äústraight cost‚Äù - bits / character = log2(numDistinctChars)</p></li>
</ul>
</li>
<li><p>Priority Queue Example</p>
<ul>
<li><p>insert (x)</p></li>
<li><p>deleteMin()</p></li>
<li><p>findMin()</p></li>
<li><p>isEmpty()</p></li>
<li><p>makeEmpty()</p></li>
<li><p>size()</