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.
  1. Practice
  2. Data Structures
  3. Linked Lists
  4. Insert a Node at the Tail of a Linked List
  5. Discussions

Insert a Node at the Tail of a Linked List

  • DanHaggard + 1 comment

    I think you can trim one line out of your non-recursive solution:

    def Insert(head, data):
    if head == None:
        return Node(data, None)
    curr_node = head
    while curr_node.next != None:
        curr_node = curr_node.next
    curr_node.next = Node(data, None)
    return head
    • psykosh + 0 comments

      My code is basically the same other than naming and using "is/is not" for testing if None...

      and it's failing.

      def Insert(head, data):
    if head is None:
        return Node(data)
    here = head
    while here.next is not None:
        here = here.next
    here.next = Node(data)
    return head