We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
def insert(self, head, data):
new_node = Node(data)
if head is None:
head = new_node
else:
current = head
while current.next:
current = current.next
current.next = new_node
return head
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Day 15: Linked List
You are viewing a single comment's thread. Return to all comments →
python 3: