Search⌘ K
Home
Courses
Data Structures for Coding Interviews in C++

Structure of a Trie

Explore the basic structure of a trie and understand how to build a TrieNode and Trie class in C++. Learn how each node represents an alphabet and how the isEndWord flag helps in word searches.

We'll cover the following...

Introduction

In this lesson, we will take a look at the basic structure of a trie and then build a class in C++ based on what we’ve studied.

g t t o o t->o h h t->h p p o->p u u h->u e e h->e s s u->s i i e->i r r i->r Root Root Root->t
Trie containing "top", "thus" and "their".

The Trie Node Class #

The node of a trie represents an alphabet. For example, if we want to insert “hello” in the Trie, we will need to add 5 nodes, one ...