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. Prepare
  2. Data Structures
  3. Linked Lists
  4. Delete a Node
  5. Discussions

Delete a Node

  • somaditya
     + 0 comments

    simplest python solution:

    def deleteNode(llist, position):
    curr = llist
    prev = llist
    
    if position == 0:
        return llist.next
        
    for i in range(position):
        prev = curr
        curr = curr.next
        
    prev.next = curr.next
    
    return llist