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 ...