Grokking Data Structures & Algorithms for Coding Interviews
Vote

0% completed

Flashcards Review

Flashcards Review

Use these cards to review the Trie chapter before you take the checkpoint. Each card shows a question on the front and a short answer on the back. Answer it in your head first, then flip the card. The deck covers what a trie node holds, insertion, search and the three deletion cases, why a trie beats a search tree on strings, and the idea behind each of the five problems you solved.

.....

.....

.....

Like the course? Get enrolled and start learning!

Reading Progress

0%


Vote for new content