Sartaj Sahni
University of Florida
29.3Keys with Different Length
29.5Space Required and Alternative Node Structures
29.8Prefix Search and Applications
Compressed Tries with Digit Numbers•Compressed Tries with Skip Fields•Compressed Tries with Edge Information•Space Required by a Compressed Trie
Searching•Inserting an Element•Removing an Element
A trie (pronounced “try” and derived from the word retrieval) is a data structure that uses the digits in the keys to organize and search the dictionary. Although, in practice, we can use any radix to ...
Get Handbook of Data Structures and Applications, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
