Huffman coding demonstrates how a greedy strategy can construct an optimal prefix code for a set of character frequencies. A trie demonstrates how strings can be organized by their shared prefixes.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results