Back to Developer Roadmap

Tries

src/data/roadmaps/computer-science/content/tries@4qUVacMEz3XFiL_dMre6P.md

4.01.4 KB
Original Source

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: