Tries
Last updated
What is 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.
Free resources to learn Tries
- Course0. Tries - Coursera
- Course1. R Way Tries
- Course2. Ternary Search Tries
- Course3. Character Based Operations
- ArticleTries - DataStructure Notes
- ArticleThe Trie: A Neglected Data Structure
- ArticleTopCoder - Using Tries
- VideoStanford Lecture (real world use case)
- VideoMIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through)
More in stage 14: Tries
Tries: common questions
Can I learn Tries in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Tries in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Tries tutorial for beginners?
It is lesson 107 of 188 in the free Computer Science roadmap, in stage 14, Tries. If you are new to Computer Science, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.