The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search ...

The ternary search tree (TST) is the champion of data structure acrobatics — it finds all keys having a given prefix, suffix, or infix. It even finds those keys that closely match a given pattern. You ...