RightSignalLearn · track
Data structures
The shapes programs keep data in, and why picking the right one makes code fast.
0 of 11 doneStart: Hash tables
- Big-O notationDescribing how work grows as the input grows · Coming soon
- ArraysItems side by side in memory, found instantly by position · Coming soon
- Linked listsItems that point to the next, cheap to insert into · Coming soon
- Hash tablesFinding any key in about one step · 3 min
- Binary searchHalving a sorted list until the answer is left · Coming soon
- Binary treesData that branches in two, kept in order · Coming soon
- HeapsAlways knowing the smallest item, as in a priority queue · Coming soon
- TriesTrees of letters behind autocomplete · Coming soon
- B-treesWide, shallow trees that suit disks and databases · 6 min
- Bloom filtersA tiny structure that says definitely not, or probably yes · 3 min
- GraphsThings and the links between them: maps, networks, friends · Coming soon