A complete guide to learning everything there is to know about data structures
InstructorWilliam Fiset
The curriculum includes specialized structures such as Fenwick trees, AVL trees, and indexed priority queues that are often absent from standard curricula.
Editorial course preview
These 3 complementary views highlight concrete, legible examples from the course presentation.
This diagram illustrates a hash table using separate chaining, where each bucket index points to a linked list of key-value pairs for names and ages.
This slide illustrates the concept of inserting with ghosts in a hash table, demonstrating how replacing an early tombstone during lookup optimizes future searches via lazy deletion.
An introductory slide detailing the instructor's background as an ACM-ICPC world finalist and software engineer at Google, alongside his educational qualifications.
One sampled review suggests that instruction pairs animated visual representations with specific source code reviews to demonstrate how data structures are constructed.
Quizzes are provided, but learners have noted a lack of independent coding problems or practical exercises to reinforce the material.
Implementations are restricted to Java, which may limit utility for those working in C++ or Python. Some signals also suggest a need for deeper asymptotic notation explanations.
The technical depth may be too high for absolute beginners while remaining limited by its single-language focus.