{"id":27433,"date":"2018-02-02T21:28:55","date_gmt":"2018-02-02T15:58:55","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27433"},"modified":"2018-02-02T21:28:55","modified_gmt":"2018-02-02T15:58:55","slug":"python-algorithm-delete-a-linked-list-node-at-a-given-position","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/python-algorithm-delete-a-linked-list-node-at-a-given-position\/","title":{"rendered":"Python Algorithm- Delete a Linked List node at a given position"},"content":{"rendered":"

Given a singly linked list and a position, delete a linked list node at the given position.<\/span><\/p>\n

Example:<\/strong><\/p>\n

Input: position = 1, Linked List = 8->2->3->1->7\r\nOutput: Linked List =  8->3->1->7\r\n\r\nInput: position = 0, Linked List = 8->2->3->1->7\r\nOutput: Linked List = 2->3->1->7<\/pre>\n
If node to be deleted is root, simply delete it. To delete a middle node, we must have pointer to the node previous to the node to be deleted. So if positions is not zero, we run a loop position-1 times and get pointer to the previous node.<\/p>\n[ad type=”banner”]\n
Python Programming:<\/strong><\/p>\n
 
 <\/div> 
# Python program to delete a node in a linked list# at a given position # Node class class Node:     # Constructor to initialize the node object    def __init__(self, data):        self.data = data        self.next = None class LinkedList:     # Constructor to initialize head    def __init__(self):        self.head = None     # Function to insert a new node at the beginning    def push(self, new_data):        new_node = Node(new_data)        new_node.next = self.head        self.head = new_node     # Given a reference to the head of a list     # and a position, delete the node at a given position    def deleteNode(self, position):         # If linked list is empty        if self.head == None:            return         # Store head node        temp = self.head         # If head needs to be removed        if position == 0:            self.head = temp.next            temp = None            return         # Find previous node of the node to be deleted        for i in range(position -1 ):            temp = temp.next            if temp is None:                break         # If position is more than number of nodes        if temp is None:            return        if temp.next is None:            return         # Node temp.next is the node to be deleted        # store pointer to the next of node to be deleted        next = temp.next.next         # Unlink the node from linked list        temp.next = None         temp.next = next      # Utility function to print the linked LinkedList    def printList(self):        temp = self.head        while(temp):            print " %d " %(temp.data),            temp = temp.next  # Driver program to test above functionllist = LinkedList()llist.push(7)llist.push(1)llist.push(3)llist.push(2)llist.push(8) print "Created Linked List: "llist.printList()llist.deleteNode(4)print "\\nLinked List after Deletion at position 4: "llist.printList() <\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
Created Linked List: \r\n 8  2  3  1  7 \r\nLinked List after Deletion at position 4: \r\n 8  2  3  1<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Python Algorithm- Delete a Linked List node at a given position – Linked List If node to be deleted is root, simply delete it. To delete a middle node<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[79476,79478],"tags":[79924,79917,79920,79922,79918,79914,79916,79921,79915,79923],"class_list":["post-27433","post","type-post","status-publish","format-standard","hentry","category-linked-list","category-singly-linked-list","tag-c-program-to-delete-first-node-in-linked-list","tag-delete-a-node-from-linked-list-algorithm","tag-delete-a-node-in-linked-list-with-single-pointer","tag-delete-a-node-in-singly-linked-list","tag-delete-last-node-in-linked-list-in-c","tag-delete-node-at-given-position-in-a-linked-list","tag-delete-node-linked-list-c","tag-deletion-in-linked-list-in-data-structure","tag-linked-list-delete-node-java","tag-write-a-program-to-delete-a-node-from-linked-list-in-c"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27433","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=27433"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27433\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27433"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27433"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27433"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}