String Algorithms

Trie (Prefix Tree) Monster

Visualize prefix-based word storage character-by-character. Search, insert, or trace paths interactively.

0
Words
0
Nodes
0
Height
0
Operations
TRIE PREFIX TREE
Inserted Words
No words inserted yet

Execution Log

Enter a word to see how it's stored character by character.
Path Tracer Game 0
Trace the target word path in the Trie starting from root.

🏗️ Trie Concept

A Trie (Prefix Tree) is a search tree where nodes represent common prefixes. Characters on path trace out keys. Green nodes indicate the End of Word.

Trie Complexity

Insert Word O(L)
Search Word O(L)
Prefix Search O(P)