Tries
← Back to Tree Structures
Tree structure where each node represents a character and paths from root to leaves represent strings. Optimized for prefix-based operations.
Key Properties
Complexity
| Operation | Time Complexity |
|---|---|
| Insert/Search/Delete | O(m) where m is key length |
Space can be high but compressed tries (radix trees) help.
Related
- Hash Tables (alternative for string lookup)
- Binary Search Trees