Skip to main content

Tries

1 lessonAbout 6 minutesIntermediate

This part of the DSA Tutorial runs from Tries (Prefix Trees). There is 1 lesson here, and working through them takes about 6 minutes at a steady pace.

It follows on from Trees, so finish that first if you have not already — the examples below assume you are comfortable with it.

Each lesson below says what it covers before you open it. Read them in order the first time; afterwards this page works as a index you can jump back into when you need to check one thing.

  1. 1Tries (Prefix Trees)A trie stores strings by shared prefix, making autocomplete and prefix search O(length) instead of O(number of words). Build one in JavaScript and know when a Set is better.