Skip to content
Related Articles
Get the best out of our app
GeeksforGeeks App
Open App

Related Articles

Python Program For Deleting A Given Node In Linked List Under Given Constraints

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

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. 
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): = data = None
# LinkedList class
class LinkedList:
    def __init__(self):
        self.head = None
    def deleteNode(self, data):
        temp = self.head
        prev = self.head
        if == data:
            if is None:
                print("Can't delete the node as it has only one node")
        while is not None and != data:
            prev = temp
            temp =
        if is None and !=data:
            print("Can't delete the node as it doesn't exist")
         # If node is last node of the linked list
        elif is None and == data:
   = None
    # To push a new element in the Linked List    
    def push(self, new_data):
        new_node = Node(new_data) = self.head
        self.head = new_node
    # To print all the elements of the Linked List
    def PrintList(self):
        temp = self.head
            print(, end = " ")
            temp =
# Driver Code
llist = LinkedList()
print("Given Linked List: ", end = ' ')
Deleting node 10:")
print("Modified Linked List: ", end = ' ')
Deleting first node")
print("Modified Linked List: ", end = ' ')
# This code is contributed by Akarsh Somani


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!

My Personal Notes arrow_drop_up
Last Updated : 22 Jun, 2022
Like Article
Save Article
Similar Reads
Related Tutorials