**Delete a Node**

### Problem Statement :

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNode has the following parameters: - SinglyLinkedListNode pointer llist: a reference to the head node in the list - int position: the position of the node to remove Returns - SinglyLinkedListNode pointer: a reference to the head of the modified list Input Format: The first line of input contains an integer n, the number of elements in the linked list. Each of the next n lines contains an integer, the node data values in order. The last line contains an integer, position, the position of the node to delete. Constraints: 1. 1<=n<=1000 2. 1<=list[i]<=1000

### Solution :

` ````
Solution in C :
In C:
//the following function is all that is needed to complete
// the challenge in hackerrank platform.
SinglyLinkedListNode* deleteNode(SinglyLinkedListNode* llist, int position) {
if((position) == 0) {
return llist->next;
}
llist->next = deleteNode(llist->next, position-1);
return llist;
}
In C++:
//the following function is all that is needed to complete
//the challenge in hackerrank platform
Node* Delete(Node *head, int position)
{
// Complete this method
Node *prev = NULL;
Node *ptr = head;
int pos = 0;
if(position==0)
{
head=head->next;
delete (ptr);
}
else
{
while(position!=pos)
{
++pos;
prev=ptr;
ptr=ptr->next;
}
if(ptr!=NULL)
{
prev->next=ptr->next;
delete (ptr);
}
}
return head;
}
In Java:
//the following method is all that is needed to complete the
//challenge in hackerrank plartform
static SinglyLinkedListNode deleteNode(SinglyLinkedListNode llist, int position) {
int currentNodePosition = 0;
SinglyLinkedListNode head = llist;
SinglyLinkedListNode currentNode = llist;
if (position == 0) {
head = head.next;
return head;
}
while (currentNodePosition < position - 1) {
currentNode = currentNode.next;
currentNodePosition++;
}
if (currentNode.next != null && currentNode.next.next != null) {
currentNode.next = currentNode.next.next;
}
return head;
}
In Python 3:
#the following method is all that is needed to complete the
#challenge in hackerrank platfrom
def Delete(head, position):
currentPos = 0
prevNode = None
node = head
while currentPos < position:
currentPos = currentPos+1
prevNode = node
node = node.next
if prevNode is not None:
prevNode.next = node.next
return head
else:
n = node.next
node.next = None
return n
```

## View More Similar Problems

## Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →## Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

View Solution →## Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →## Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →## Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

View Solution →## Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

View Solution →