What is a Trie?

Introduction

The previous section covered several common types of trees like red-black trees, 2-3 trees, and more.

Now, you are going to look at a tree-like data structure, which proves to be really efficient when solving programming problems related to strings.

This data structure is called a Trie and is also known as a Prefix Tree. You will soon find out why.

💡 Did you know?

Trie basically comes from the word “retrieval” as the main purpose of using this structure is that it provides fast retrieval. Tries are mostly used for searching words in the dictionary. It provides auto-suggestions in search engines, and IP routing as well.