ECS 30 Lecture 27: Lecture 27
![](https://new-preview-html.oneclass.com/6YPy0AD8OkL3m1bZkzrwjaBe7J2KRExq/bg1.png)
Lecture 27
The case for a dynamic ADT
- Extensible collection of data
o But extensibility actually very limited
- Inserting an item
- Removing an item
- Needs a contiguous space in memory
Basic structure
- The most famous ADT in C
- Each item is linked to the next in the series
- Its possible to insert and delete code in the middle
Insertion - front and back
- See diagram:
find more resources at oneclass.com
find more resources at oneclass.com