Concept explorer

See what to learn first, and what it unlocks

Pick a subject, then click a concept. The path before it and after it lights up and everything else fades. Shapes on the edges are the subjects it connects to. Click the ⓘ on a concept for its details.

33 concepts · 9 steps. Read left to right: each concept needs the ones before it. all subject lines

Data types, operators and expressions

Control flow and loopsT2

C memory layout: text, data, heap, stack

Functions and parameter passing

Scope, lifetime and storage classes

Evaluation order, sequence points and undefined behaviour

Bitwise operationsT2

Preprocessor and macrosT2

Arrays and indexing

Pointers and pointer arithmetic

Arrays, strings and pointers together

Multidimensional arrays and address calculation

Dynamic memory: malloc, free and leaks

Structures, unions and memory alignmentT2

Function pointersT2

Recursion and the call stack

Recursion patterns: tracing and output questions

Stack (ADT) and its implementations

Stack applications: expression evaluation and matching

Queue, circular queue and deque

Queue applications and queue using stacksT2

Singly linked lists

Doubly and circular linked listsT2

Reversal, cycle detection and merging

Trees: terminology and properties

Binary tree traversals

Constructing trees from traversals

Counting binary trees and tree properties

Binary search trees

AVL trees and rotationsT2

Binary heaps and heap operations

Priority queues and building a heap

Graph representations

learn first unlocks subject this one builds on subject that builds on or relates to thisT2 lighter tier opens the details window