{"id":26823,"date":"2017-06-01T14:12:47","date_gmt":"2017-06-01T08:42:47","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26823"},"modified":"2017-12-24T15:37:19","modified_gmt":"2017-12-24T10:07:19","slug":"26823-2","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/26823-2\/","title":{"rendered":"Python Algorithm – Deleting a node in Linked List | Set 3"},"content":{"rendered":"

We have discussed Linked List Introduction and Linked List Insertion in previous posts on singly linked list.<\/span><\/p>\n

Let us formulate the problem statement to understand the deletion process. Given a \u2018key\u2019, delete the first occurrence of this key in linked list<\/em>.
\nTo delete a node from linked list, we need to do following steps.
\n1) Find previous node of the node to be deleted.
\n2) Changed next of previous node.
\n3) Free memory for the node to be deleted.<\/p>\n

\"Deleting<\/p>\n

Since every node of linked list is dynamically allocated using malloc() in C, we need to call free()<\/a> for freeing memory allocated for the node to be deleted.<\/p>\n

Python Programming:<\/strong><\/p>\n

 <\/p>\n

<\/div> 
# Python program to delete a node from linked list # Node class class Node:     # Constructor to initialize the node object    def __init__(self, data):        self.data = data        self.next = None class LinkedList:     # Function 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 key,    # delete the first occurence of key in linked list    def deleteNode(self, key):                 # Store head node        temp = self.head         # If head node itself holds the key to be deleted        if (temp is not None):            if (temp.data == key):                self.head = temp.next                temp = None                return         # Search for the key to be deleted, keep track of the        # previous node as we need to change 'prev.next'        while(temp is not None):            if temp.data == key:                break            prev = temp            temp = temp.next         # if key was not present in linked list        if(temp == None):            return         # Unlink the node from linked list        prev.next = temp.next         temp = None      # Utility function to print the linked LinkedList    def printList(self):        temp = self.head        while(temp):            print " %d" %(temp.data),            temp = temp.next  # Driver programllist = LinkedList()llist.push(7)llist.push(1)llist.push(3)llist.push(2) print "Created Linked List: "llist.printList()llist.deleteNode(1) print "\\nLinked List after Deletion of 1:"llist.printList() # This code is contributed by Nikhil Kumar Singh (nickzuck_007)<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
Created Linked List:\r\n 2  3  1  7\r\nLinked List after Deletion of 1:\r\n 2  3  7<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Python Algorithm – Deleting a node in Linked List – Linked List – We have discussed Linked List Introduction and Linked List Insertion in previous<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,79476,4148,79478],"tags":[79924,79917,79920,79922,79925,79918,79914,79916,79919,79921,79915,79923],"class_list":["post-26823","post","type-post","status-publish","format-standard","hentry","category-coding","category-linked-list","category-python","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-a-node-in-the-middle-of-a-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-delete-specific-node-in-linked-list","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\/26823","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=26823"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26823\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26823"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26823"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26823"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}