# Javascript Program For Inserting Node In The Middle Of The Linked List

Given a linked list containing n nodes. The problem is to insert a new node with data x at the middle of the list. If n is even, then insert the new node after the (n/2)th node, else insert the new node after the (n+1)/2th node.

Examples:

```Input : list: 1->2->4->5
x = 3
Output : 1->2->3->4->5

Input : list: 5->10->4->32->16
x = 41
Output : 5->10->4->41->32->16```

Method 1(Using length of the linked list):
Find the number of nodes or length of the linked using one traversal. Let it be len. Calculate c = (len/2), if len is even, else c = (len+1)/2, if len is odd. Traverse again the first c nodes and insert the new node after the cth node.

## Javascript

 ``

Output:

```Linked list before insertion: 1 2 4 5
Linked list after insertion: 1 2 3 4 5```

Time Complexity : O(n)
Auxiliary Space : O(1)

Method 2(Using two pointers):
Based on the tortoise and hare algorithm which uses two pointers, one known as slow and the other known as fast. This algorithm helps in finding the middle node of the linked list. It is explained in the front and black split procedure of this post. Now, you can insert the new node after the middle node obtained from the above process. This approach requires only a single traversal of the list.

## Javascript

 ``

Output:

```Linked list before insertion: 1 2 4 5
Linked list after insertion: 1 2 3 4 5```

Time Complexity: O(n)

Space complexity: O(n) where n is size of linked list

Please refer complete article on Insert node into the middle of the linked list for more details!

Previous
Next