Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
55 changes: 55 additions & 0 deletions Sprint-2/implement_linked_list/linked_list.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,55 @@
class Node:
__slots__ = ("value", "next", "previous")

def __init__(self, value):
self.value = value
self.next = None
self.previous = None
Comment on lines +1 to +7

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

May I suggest exploring the use of __slots__ to reduce memory usage?

Copy link
Copy Markdown
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks for the suggestion! I've added slots to the Node class to reduce per-instance memory overhead.


class LinkedList:
def __init__(self):
self.head = None
self.tail = None

def push_head(self, value):
node = Node(value)

if self.head is None:
self.head = node
self.tail = node
else:
node.next = self.head
self.head.previous = node
self.head = node

return node

def pop_tail(self):
node = self.tail

if node is None:
return None

self.remove(node)

return node.value

def remove(self, node):
if node == self.head and node == self.tail:
self.head = None
self.tail = None

elif node == self.head:
self.head = node.next
self.head.previous = None

elif node == self.tail:
self.tail = node.previous
self.tail.next = None

else:
node.previous.next = node.next
node.next.previous = node.previous

node.next = None
node.previous = None
Loading