Next: October 8
Up: October lecture summary
Previous: October 3
October 7
- Continue Ordered and Unordered List
ADT.
- Queues and stacks, representations using arrays and pointers.
- Doubly linked lists, circular queues.
- Time complexity of push, pop, enter, and exit for stacks and queues.
- Improve the time complexity of enter (for a queue) by using a
circular representation.
Danny Heap
2002-12-13