**Trie** (also known as Prefix Tree) is a data structure, where each character of the data is represented by a node. Words are stored by creating paths from the root node through connected character nodes. ``` root | c | a / | \ r* t* l | | t* l* (* indicates this is a valid word ending) ``` ### See also 1. [[Benefits of using Trie data structure]] 2. [[Leaf (tree data structure)]] 3. [[Node (tree data structure)]] 4. [[Why it’s called trie instead of tree?]] 5. [[What Radix Tree is?]]