| 
|
Quote: ternary search trees better than binary trees, tries, and hashing; dynamic, fast operations including unsuccessful search and sort
topics >
all references >
references a-b >
Topic:
search algorithms
Topic:
hash table and hash functions
Quotation Skeleton
Ternary search trees [with branches for less than, equal to, greater than] are efficient and easy … feel that they are superior to hashing in … or successful searches. @ Ternary trees are usually … @ Ternary trees support many other operations, such … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: search algorithms (40 items)
Topic: hash table and hash functions (41 items)