2 ms·
Binary search in unbalanced tree with shorter branches to more frequently used letters will be probably best (this is really huffman coding, isn't it?
by ajuc 17y ago
Binary search in unbalanced tree with shorter branches to more frequently used letters will be probably best (this is really huffman coding, isn't it?