# Delete Node in a Linked List – Leetcode Solution

In this post, we are going to solve the 237. Delete Node in a Linked List problem of Leetcode. This problem 237. Delete Node in a Linked List is a Leetcode easy level problem. Let’s see the code, 237. Delete Node in a Linked List – Leetcode Solution.

## Problem

It is guaranteed that the node to be deleted is not a tail node in the list.

### Example 1 :

``````Input: head = [4,5,1,9], node = 5
Output: [4,1,9]
Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.``````

### Example 2 :

``````Input: head = [4,5,1,9], node = 1
Output: [4,5,9]
Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.``````

### Constraints

• The number of the nodes in the given list is in the range `[2, 1000]`.
• `-1000 <= Node.val <= 1000`
• The value of each node in the list is unique.
• The `node` to be deleted is in the list and is not a tail node

Now, let’s see the code of 237. Delete Node in a Linked List – Leetcode Solution.

# Delete Node in a Linked List – Leetcode Solution

### 237. Delete Node in a Linked List – Solution in Java

```/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*/
public class Solution {
public void deleteNode(ListNode node) {
if(node != null && node.next != null) {
node.val = node.next.val;
node.next = node.next.next;
}
}
}```

### 237. Delete Node in a Linked List – Solution in C++

```/**
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void deleteNode(ListNode* node) {
ListNode*  temp = node->next;
node->val = temp->val;
node->next = temp->next;

delete temp;
}
};```

### 237. Delete Node in a Linked List – Solution in Python

```# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
def deleteNode(self, node):
node.val = node.next.val
node.next = node.next.next```

Note: This problem 237. Delete Node in a Linked List is generated by Leetcode but the solution is provided by CodingBroz. This tutorial is only for Educational and Learning purpose.