Text Search with Tries

Text Search with Tries.
In the previous post in the Data Structures and Algorithms in the Wild series, we discussed the quadtree, a tree data structure used to index locations in two-dimensional space. In this post, we’ll look into another data structure called the trie.
Like the quadtree, the trie is also a tree structure. But, while quadtrees search locations, tries search text.
Prefix tries Say we wish to write a program to find all the words in a dictionary that start with a prefix.

Read in full here:

This thread was posted by one of our members via one of our news source trackers.

Corresponding tweet for this thread:

Share link for this tweet.