Type any prefix — both trees traverse simultaneously — Left • Equal • Right

🔍
TRIE — Prefix Tree Each node = 1 character • Shared prefix "auto" is a single path
TST — Ternary Search Tree Compare 1 char per node • L=less • E=equal • R=greater
LO (char < node)
EQ (char = node)
HI (char > node)
Matched
TST Traversal Decisions (character comparisons)
Type a prefix above to see node-by-node comparisons