This lesson's interactive features are locked, please to keep using them
Linked Lists
Remember how the push method on our Queue is O(n) instead of O(1)?
def push(self, item: str) -> None:
# everything in self.items has to shift
# up a position, which takes O(n) time
self.items.insert(0, item)
Let's fix that.
To build a faster queue, we'll use a Linked List instead of a regular List (array) under the hood. A linked list is where elements are not stored next to each other in memory, instead, each item references the next in a chain.
Nodes
Our nodes will be represented by a simple class with two fields:
val- The raw string value that the node holds (e.g. 'Carla', 'James', etc)next- A reference to the next node in the list
Assignment
Let's lock-in and make LockedIn faster!