Delete a Node

[ndrohith09]

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

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 , the number of elements in the linked list.
Each of the next lines contains an integer, the node data values in order.
The last line contains an integer, , the position of the node to delete.

Constraints

Sample Input

8
20
6
2
19
7
4
15
9
3

Sample Output

20 6 2 7 4 15 9

Explanation

The original list is 20 -> 6 -> 2 -> 19 -> 7 -> 4 -> 15 -> 9 . After deleting the node at position 3, the list is 20 -> 6 -> 2 -> 7 -> 4 -> 15 ->9.

[krithi113]

I would like to solve it in c++

[jaichiranjeeva]

I would also like to solve this in python & Java