Data Structures · topic
A master complexity table for every structure, the traps that cost marks with their fixes, question patterns with the first step to take, and a one-page last-day sheet.
One full-width table with the cost of access, search, insertion, deletion and minimum or maximum for arrays, linked lists, stacks, queues, binary trees, binary search trees, AVL trees (beyond the named syllabus) and binary heaps, a table of whole-structure tasks such as build-heap, traversals, reconstruction and graph traversal per representation, and the complexity slips that cost marks. Each row points to the sheet that derives it.
A partial preview of the top of the sheet. The full sheet is in the Data Structures cheat sheet pack.
Twenty-seven wrong intuitions about arrays, stacks, queues, linked lists, binary trees, binary search trees, AVL trees (beyond the named syllabus), heaps and graph representations, each next to the correct rule and a verified number or a pointer to the sheet that explains it.
A partial preview of the top of the sheet. The full sheet is in the Data Structures cheat sheet pack.
The recurring shapes of data structure questions, each with the cue that identifies it, the first step, the method, the assumption to check and the usual failure, plus a table matching needs to structures. Patterns describe past question shapes, not a forecast.
A partial preview of the top of the sheet. The full sheet is in the Data Structures cheat sheet pack.
The whole Data Structures pack on one page: address and packing formulas, stack, expression and queue rules, list costs, tree counts and traversal facts, BST rules, AVL rules (beyond the named syllabus), heap indexing and build-heap, graph representation costs, and the five conventions to read from every stem.
A partial preview of the top of the sheet. The full sheet is in the Data Structures cheat sheet pack.
