∫audeac · learn
Computer Science
🌲
Topic 04

Topic 4 · Abstract Data Structures (HL)

Stacks, queues, lists, recursion and trees.

0 / 8 sections complete · 4 chapters
🧠Topic cheatsheet & recall test — memorise every formula
🔒
This topic is part of Pro.
Free plan covers Topic 1 · Chapter 1 only. Upgrade to unlock all 10 topics.
Sign up free
Chapter 1Pro

Stacks, queues & linked lists

  • 🔒
    Stacks & Queues
    ~15 min·practice inside
    Sign up
  • 🔒
    Arrays vs Linked Lists
    ~16 min·practice inside
    Sign up
📋
Chapter 1 Cheatsheet
5 key formulas · always available · printable
Open →
🔒
Chapter 1 Quiz
Pro plan required for this quiz
Chapter 2🔒 Locked

Recursion & trees

Finish every section in Chapter 1 to unlock.

  • 🔒
    Recursion & the Call Stack
    ~18 min·practice inside
  • 🔒
    Binary Trees & Traversals
    ~18 min·practice inside
📋
Chapter 2 Cheatsheet
5 key formulas · always available · printable
Open →
🔒
Chapter 2 Quiz
Chapter locked
Chapter 3🔒 Locked

Algorithm efficiency

Finish every section in Chapter 2 to unlock.

  • 🔒
    Why Some Algorithms Don't Scale
    ~16 min·practice inside
  • 🔒
    Searching & Sorting
    ~18 min·practice inside
📋
Chapter 3 Cheatsheet
4 key formulas · always available · printable
Open →
🔒
Chapter 3 Quiz
Chapter locked
Chapter 4🔒 Locked

Going deeper & exam practice

Finish every section in Chapter 3 to unlock.

  • 🔒
    Dictionaries (Hash Tables)
    ~16 min·practice inside
  • 🔒
    Data Structures — Structured Questions
    ~22 min·practice inside
📋
Chapter 4 Cheatsheet
8 key formulas · always available · printable
Open →
🔒
Chapter 4 Quiz
Chapter locked