Computer Science › Section I · Data abstractions › Topic I.3
Implementing data structures
Every array, list, stack, queue and tree must end up in plain numbered memory cells. A few simple techniques, an address formula, pointers and wrap-around, are enough to store them all, and translators use them every time you index an array.
In this topic
- Storing a one-dimensional array
- Two-dimensional arrays: row-major order
- Worked example: finding an entry's address
- Storing records
- Contiguous lists and linked lists
- Worked example: editing a linked list
- Stacks and queues in a reserved block
- Worked example: a circular queue
- Storing binary trees
- Trees without pointers
- Common mistakes to avoid
- Key takeaways
This topic is part of Wuanberri Pro. Checking your access…