Computer Science › Section I · Data abstractions › Topic I.1
Basic data structures
Memory is a single row of numbered cells, but problems come in other shapes: tables, waiting lines, undo histories and hierarchies. Data structures give programs those shapes, and five of them, arrays, lists, stacks, queues and trees, appear almost everywhere.
In this topic
- Organising data on purpose
- Arrays in two dimensions
- Lists
- Stacks: last in, first out
- Worked example: checking brackets
- Queues: first in, first out
- Worked example: a printer queue
- Stacks and queues in Python
- Trees
- Worked example: a folder tree
- Common mistakes to avoid
- Key takeaways
This topic is part of Wuanberri Pro. Checking your access…