|
Related articles:
Hash table
Associative array
Binary search tree
Radix sort
Suffix tree
Directed acyclic graph
Key terms: key trie node tree hash data tries string value lookup search common storing word find algorithm compression needed log sparse prefix associated array fast kind hash table insert empty advantages sorting acyclic traversal branches application dimension data structure storage worst case dictionary looking up terminal all keys collisions representation lookup tables binary search tree implementation deterministic finite computer science imperfect hash table Search external links cited by footnotes on Wikipedia page Trie: |
|