May 1, 2024
Updated May 9, 2025
17 minute read
An Introduction to Tries: The Versatile Prefix Tree
A Trie, also known as a prefix tree or digital tree, is a specialized tree-based data structure designed for efficient storage and retrieval of a dynamic set of strings. Imagine a dictionary where words are not just listed alphabetically, but where common starting letters are shared among entries; this is the fundamental concept behind a Trie. This structure is particularly adept at handling operations involving prefixes, making it a cornerstone in various computing applications. You might encounter Tries when using autocomplete features on search engines or in text editors, or when a spell checker suggests corrections. The ability of Tries to quickly search, insert, and delete strings based on their prefixes makes them a fascinating and powerful tool in a programmer's arsenal.
jbslxs|
Find a path to becoming a Tries. Learn more at:
OpenCourser.com/topic/jbslxs/trie
Reading list
We've selected 11 books
that we think will supplement your
learning. Use these to
develop background knowledge, enrich your coursework, and gain a
deeper understanding of the topics covered in
Tries.
Provides a comprehensive overview of Tries and Patricia trees, including their theory and practice. It good choice for students who want to learn about Tries in depth.
Provides a comprehensive overview of algorithms for strings, including Tries. It good choice for students who want to learn about Tries and other algorithms for strings.
Provides a comprehensive overview of algorithms for bioinformatics, including Tries. It good choice for students who want to learn about Tries and other algorithms for bioinformatics.
This classic textbook provides a comprehensive overview of algorithms, including Tries. It good choice for students who want to learn about Tries and other algorithms in depth.
Provides a comprehensive overview of algorithms for strings, trees, and sequences, including Tries. It good choice for students who want to learn about Tries and other algorithms for these data structures.
Provides a comprehensive overview of Tries in Java. It good choice for students who want to learn about Tries and how to implement them in Java.
Provides a practical guide to algorithm design, including Tries. It good choice for students who want to learn about how to design and implement Tries.
Provides a comprehensive overview of algorithms and data structures for massive datasets, including Tries. It good choice for students who want to learn about Tries and other algorithms for big data.
Provides a comprehensive overview of data structures and algorithms, including Tries. It good choice for students who want to learn about Tries and other data structures.
Provides a comprehensive overview of data structures and algorithm analysis, including Tries. It good choice for students who want to learn about Tries and other data structures.
Provides a comprehensive overview of data structures and algorithms, including Tries. It good choice for beginners who want to learn about Tries and other data structures.
For more information about how these books relate to this course, visit:
OpenCourser.com/topic/jbslxs/trie
Save
