Author Archive for Robert Cazoni

Working with the Trie data structure: Part 2

A Trie is a tree like data structure used for storing words in a way which facilitates fast look-ups. They prove very useful for handling dictionaries. In Part 1 we defined the trie data structure and started outlining the code for it. In this articles we are going to take a look at the basic operation we can do on a trie: Insert, Query…

1 Star2 Stars3 Stars4 Stars5 Stars (4 votes, average: 5.00 out of 5)
We send about one email per week with our latest tutorials and updates
Never display this again :)