Insert a node at a specific position in a linked list
Problem Statement :
Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its data attribute, insert this node at the desired position and return the head node.
A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is empty.
Example
head refers to the first node in the list 1->2->3
data=4.
position=2
Insert a node at position 2 with data=4. The new list is 1->2->4->3
Function Description Complete the function insertNodeAtPosition in the editor below. It must return a reference to the head node of your finished list.
insertNodeAtPosition has the following parameters:
1. head: a SinglyLinkedListNode pointer to the head of the list
2. data: an integer value to insert as data in your new node
3. position: an integer position to insert the new node, zero based indexing
Returns:
1. SinglyLinkedListNode pointer: a reference to the head of the revised list
Input Format:
The first line contains an integer n, the number of elements in the linked list.
Each of the next n lines contains an integer SinglyLinkedListNode[i].data.
The next line contains an integer dta, the data of the node that is to be inserted.
The last line contains an integer position.
Constraints:
1. 1<=n<=1000
2. 1<=Singly_LinkedListNode[i].data<1000
3. 0<=position<=n
Solution :
Solution in C :
in C:
//The following function is all you need to complete the challenge in
//hackerrank platform
SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* llist, int data, int position) {
//iterate to the correct position in the linked list
if((position-1)>0){
insertNodeAtPosition(llist->next, data, position-1);
}
else{
SinglyLinkedListNode* newnode = create_singly_linked_list_node(data);
newnode->next = llist->next;
llist->next = newnode;
}
return llist;
}
Solution in C++ :
In C++:
//the following function is all that is needed to complete
//the challenge in hackerrank platform
Node* InsertNth(Node *head, int data, int position)
{
if(position == 0){
Node* a = (Node*)malloc(sizeof(Node));
a->data = data;
a->next = head;
return a;
}else{
int i;
Node* a = head;
for(i = 1; i < position; i++)
a = a->next;
Node* tmp = (Node*)malloc(sizeof(Node));
tmp->data = data;
tmp->next = a->next;
a->next = tmp;
return head;
}
}
Solution in Java :
In Java:
//the following method is all that is needed to complete the
//challenge in hackerrank platform
static SinglyLinkedListNode insertNodeAtPosition(SinglyLinkedListNode llist, int data, int position) {
SinglyLinkedListNode node = new SinglyLinkedListNode(data);
if(position==0){
node.next = llist.next;
llist=node;
}else{
SinglyLinkedListNode aux = new SinglyLinkedListNode(0);
aux.next = llist;
for(int i=0;i<position;i++)aux=aux.next;
node.next = aux.next;
aux.next=node;
}
return llist;
}
Solution in Python :
In Python 3:
# the following method is all that is need to complete
# the challenge in hackerrank platform.
def InsertNth(head, data, position):
i = 0
newNode = Node(data, None)
if position is 0:
newNode.next = head
head = newNode
return head
curr = head
while i is not position - 1:
curr = curr.next
i+= 1
prev = curr
next = curr.next
prev.next = newNode
newNode.next = next
return head
View More Similar Problems
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 →Swap Nodes [Algo]
A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from
View Solution →Kitty's Calculations on a Tree
Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a
View Solution →Is This a Binary Search Tree?
For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a
View Solution →Square-Ten Tree
The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the
View Solution →Balanced Forest
Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a
View Solution →