All posts with Tag Trie

Preview image blogpost

The Trie - A powerful data structure

A Trie is a common data structure used for example for auto completing words. We will discover how to built our own Trie and check how fast he competes against a "normal" Hashset.

Also we will build a TypeAHead input component which automatically offers us some suggestion based on our input. Of course, we will use our newly created Trie.

Read the whole article

An error has occurred. This application may no longer respond until reloaded. Reload x