Python Program For Deleting A Given Node In Linked List Under Given Constraints Last Updated : 22 Jun, 2022 Summarize Comments Improve Suggest changes Share Like Article Like Report Given a Singly Linked List, write a function to delete a given node. Your function must follow following constraints: 1) It must accept a pointer to the start node as the first parameter and node to be deleted as the second parameter i.e., a pointer to head node is not global. 2) It should not return a pointer to the head node. 3) It should not accept pointer to pointer to the head node.You may assume that the Linked List never becomes empty.Let the function name be deleteNode(). In a straightforward implementation, the function needs to modify the head pointer when the node to be deleted is the first node. As discussed in previous post, when a function modifies the head pointer, the function must use one of the given approaches, we can't use any of those approaches here. Solution We explicitly handle the case when the node to be deleted is the first node, we copy the data of the next node to head and delete the next node. The cases when a deleted node is not the head node can be handled normally by finding the previous node and changing next of the previous node. The following are the implementation. Python 3 # Node class class Node: def __init__(self, data): self.data = data self.next = None # LinkedList class class LinkedList: def __init__(self): self.head = None def deleteNode(self, data): temp = self.head prev = self.head if temp.data == data: if temp.next is None: print("Can't delete the node as it has only one node") else: temp.data = temp.next.data temp.next = temp.next.next return while temp.next is not None and temp.data != data: prev = temp temp = temp.next if temp.next is None and temp.data !=data: print("Can't delete the node as it doesn't exist") # If node is last node of the linked list elif temp.next is None and temp.data == data: prev.next = None else: prev.next = temp.next # To push a new element in the Linked List def push(self, new_data): new_node = Node(new_data) new_node.next = self.head self.head = new_node # To print all the elements of the Linked List def PrintList(self): temp = self.head while(temp): print(temp.data, end = " ") temp = temp.next # Driver Code llist = LinkedList() llist.push(3) llist.push(2) llist.push(6) llist.push(5) llist.push(11) llist.push(10) llist.push(15) llist.push(12) print("Given Linked List: ", end = ' ') llist.PrintList() print(" Deleting node 10:") llist.deleteNode(10) print("Modified Linked List: ", end = ' ') llist.PrintList() print(" Deleting first node") llist.deleteNode(12) print("Modified Linked List: ", end = ' ') llist.PrintList() # This code is contributed by Akarsh Somani Output: Given Linked List: 12 15 10 11 5 6 2 3 Deleting node 10: Modified Linked List: 12 15 11 5 6 2 3 Deleting first node Modified Linked List: 15 11 5 6 2 3 Time Complexity: O(n), where n represents the size of the given array.Auxiliary Space: O(1), no extra space is required, so it is a constant. Please refer complete article on Delete a given node in Linked List under given constraints for more details! Comment More infoAdvertise with us Next Article Insert and delete at the beginning in Doubly Linked List in Python K kartik Follow Improve Article Tags : Python Linked Lists Practice Tags : python Similar Reads Insert and delete at the beginning in Doubly Linked List in Python A doubly linked list is a collection of nodes. It is an advanced version of a singly linked list. In a doubly linked list, a node has three elements its data, a link to the next node, and a link to its previous node. In this article, we will learn how to insert a node at the beginning and delete a n 6 min read Javascript Program To Delete N Nodes After M Nodes Of A Linked List Given a linked list and two integers M and N. Traverse the linked list such that you retain M nodes then delete next N nodes, continue the same till end of the linked list.Difficulty Level: Rookie Examples:Input:M = 2, N = 2Linked List: 1->2->3->4->5->6->7->8Output:Linked List: 3 min read Given only a pointer/reference to a node to be deleted in a singly linked list, how do you delete it? Given a pointer to a node to be deleted, delete the node. Note that we donât have a pointer to the head node.Examples:Input: list = 10 -> 20 -> 4 -> 30, delNode = 20Output: 10 -> 4 -> 30Explanation: Node with value 20 is deleted.Input: list = 1 -> 2, delNode = 1Output: 2Explanation 7 min read Implementation of XOR Linked List in Python Prerequisite: XOR Linked List An ordinary Doubly Linked List requires space for two address fields to store the addresses of previous and next nodes. A memory-efficient version of Doubly Linked List can be created using only one space for the address field with every node. This memory efficient Doub 6 min read Write a function to delete a Linked List Given a linked list, the task is to delete the linked list completely.Examples:Input: head: 1 -> 2 -> 3 -> 4 -> 5 -> NULLOutput: NULLExplanation: Linked List is Deleted.Input: head: 1 -> 12 -> 1 -> 4 -> 1 -> NULLOutput: NULLExplanation: Linked List is Deleted.Table of C 9 min read Linked list using dstructure library in Python Dstructure is a Python library for creating data structures like linked list, stack, queue, hashmap, tree, etc. A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers as shown in the below 4 min read Like