Huffman Code

Can check against the example here, though result may swap equivalent subtrees in spots (i.e. a leaf node that equals 11 could be in a spot where in the video an internal node that equals 11 is shown, and vice versa).

https://youtu.be/L5MloiCxHPk?si=qi-xI7mAilNtAc9T

Implements the min heap insertion logic expected of a priority queue. Good visuals here:

https://youtu.be/3DYIgTC4T1o?si=t6f5qM7cbXza_Rsq