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 insertNodeAtTail(head, data):
if head is not None:
current=head
while current.next is not None:
current=current.next
newnode=SinglyLinkedListNode(data)
current.next=newnode
return head
else:
newnode=SinglyLinkedListNode(data)
head=newnode
return head
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Insert a Node at the Tail of a Linked List
You are viewing a single comment's thread. Return to all comments →
def insertNodeAtTail(head, data): if head is not None: current=head while current.next is not None: current=current.next newnode=SinglyLinkedListNode(data) current.next=newnode return head else: newnode=SinglyLinkedListNode(data) head=newnode return head