A full college course in the canonical data structures every software engineer must master: arrays, linked lists, stacks, queues, trees, balanced search trees, hash tables, heaps, graphs, tries and disjoint sets. Each module teaches from first principles to mastery with Big-O analysis, ASCII sketches, and dozens of worked examples, and closes with an in-memory key-value store capstone and a Master's paper reproduction on skip lists.
Enrol to unlock the lessons, videos, and the AI tutor. College & STEM courses begin with a quick placement test, then your tutor confirms your spot.
Sign in to open this lesson — with videos, worked steps, and the Inzira AI tutor.
Log in Sign up freeSign in to open this lesson — with videos, worked steps, and the Inzira AI tutor.
Log in Sign up freeSign in to open this lesson — with videos, worked steps, and the Inzira AI tutor.
Log in Sign up freeSign in to open this lesson — with videos, worked steps, and the Inzira AI tutor.
Log in Sign up freeSign in to open this lesson — with videos, worked steps, and the Inzira AI tutor.
Log in Sign up freeSign in to open this lesson — with videos, worked steps, and the Inzira AI tutor.
Log in Sign up freeSign in to open this lesson — with videos, worked steps, and the Inzira AI tutor.
Log in Sign up freeSign in to open this lesson — with videos, worked steps, and the Inzira AI tutor.
Log in Sign up freeSign in to open this lesson — with videos, worked steps, and the Inzira AI tutor.
Log in Sign up freeSign in to open this lesson — with videos, worked steps, and the Inzira AI tutor.
Log in Sign up free