| Implementing a stack |
| 0 | Charlotte | x |
| 1 | Fred | 0 |
| 2 | Bert | 1 |
| 3 | 4 | |
| 4 | 5 | |
| 5 | 6 | |
| 6 | 7 | |
| 7 | 8 | |
| 8 | 9 | |
| 9 | x |
- Tail = 2
- FreeSpace = 3
A stack is last in first out. This means that we can not add or remove nodes in the middle of the stack. Notice that we are now pointing to the end of the list and the numbers pointers are reversed. The algorithims for pushing/popping -
Pushing
- Add the data to the node pointed to by the FreeSpace pointer.
- "FreeSpace" will then point to the next free node
- The next node will of the added node will become the tail pointer
- Tail pointer will then point to the newly added node.
Popping
- Go to the node pointed to by tail
- Set tail to be the next node pointer.
- The next node pointer will become "FreeSpace"
- Finally "freeSpace" will point to the removed node.
