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.

The researchers found that people often summarize entire episodes of a story into single sentences, leading to the conclusion that narratives are stored in memory as tree structures. In this model, ...