Compares sorted vectors, binary search trees, hash tables, and trie representations for word lexicons, including their operation costs and memory use. Covers trie space-saving designs and suffix sharing with directed acyclic graphs.

Save to open this file