This document discusses the benefits of linked lists over arrays for storing multiple items. Linked lists allow items to be dynamically added or removed without having to reindex the entire structure. Each item contains a link to the next item, rather than having a fixed placement in memory like arrays. The document asks the reader to write pseudocode to demonstrate common linked list operations like insertion, deletion, finding length, and reversing order.

1. Linked Lists

2. Multiple items?
• Multiple names
– FredsHouse, JohnsHouse, PetersHouse
– Problems?
• Arrays
– House[1], House[2], House[3]
– Benefits?
– Problems?
• Indirect Addressing

3. Drawbacks of Arrays
• Not flexible
• Think about deleting an item from an
array
• Only allow linear/grid arrangements
• Require you to plan – how big will it
be? (very hard to make bigger)

4. Linked lists
This is a big improvement
Why?

5. Linked lists
What’s missing?

6. Linked lists

7. Exercise
• Write pseudo-code for the following
linked list operations:
1. Insert an item between nodes 3 and 4
2. Delete node 3
3. Find out how many items there are in the
list
4. Reverse the order of the items.