Skip to content
← All pathways
Computer ScienceIntermediateRevision 1

Core Data Structures

Compare access rules, collision strategies, priority ordering, and prefix sharing across four essential data structures.

5 stepsAbout 95 minutesChoose a structure by the operations and performance guarantees a problem needs.

A lab, not a slideshow

How each chapter works

1 · Predict

Commit to what you think the system will do before pressing play.

2 · Observe

Change one variable and watch the state, algorithm, or model respond.

3 · Explain

State the invariant or principle, then prove it in the checkpoint.

Saved learning progress

Your ordered steps

Checking saved progress…

Chapter progress

0%

Next: Contrast stacks and queues

Continue
  1. Next suggested
    Step 1

    Step 1Experiment

    Contrast stacks and queues

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  2. Step 2

    Step 2Experiment

    Resolve hash collisions

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  3. Step 3

    Step 3Experiment

    Maintain heap order

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  4. Step 4

    Step 4Experiment

    Search shared prefixes with a trie

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  5. Step 5

    Step 5Prove

    Data structures checkpoint

    Use the evidence from the chapter to pass a server-scored knowledge check.

    Take knowledge check