computer-scienceangular-roadmapbackend-roadmapblockchain-roadmapdba-roadmapdeveloper-roadmapdevops-roadmapfrontend-roadmapgo-roadmaphactoberfestjava-roadmapjavascript-roadmapnodejs-roadmappython-roadmapqa-roadmapreact-roadmaproadmapstudy-planvue-roadmapweb3-roadmap
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1.4 KiB
1.4 KiB
Tries
Tries are a data structure that can be used to store strings. The idea is to store the characters of the string in a tree-like structure, where each node of the tree represents a single character. We can use this structure to store strings in a way that allows us to quickly search for strings with a common prefix.
Visit the following resources to learn more:
- @article@Tries - DataStructure Notes
- @article@The Trie: A Neglected Data Structure
- @article@TopCoder - Using Tries
- @video@Stanford Lecture (real world use case)
- @video@MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through)
- @course@0. Tries - Coursera
- @course@1. R Way Tries
- @course@2. Ternary Search Tries
- @course@3. Character Based Operations