CP164 Lecture Notes - Lecture 12: Priority Queue, Linked Data
Document Summary
Circular queue will be on a bit. Ask: which is more efficient a logn algorithm or nlogn algorithm of it is bigger than it takes longer than something. Move away from that and go to linked structures, we can no longer ask python what is at location 5. We are going to have to write the code that is going to move things into the proper places called nodes. Node will provide a piece of daa and a link to another node. Things we do in linked data structures will replace with linked stack. When testing new stack and queue should we able to use old test code and only change import statement (import stack link) should be only change. How they are linked together determines the type of data structure that is built. 7531 one is going tobe at top and 7 at bottom. _top-->identify the top of the linking stack.
