Move front node of the given list to the front of the another list

Given a linked list, move front node of it to the front of the another given list. Get great deals at Amazon

Remove duplicates from a sorted linked list

Given a linked list sorted in increasing order, write a function which removes any duplicate nodes from the list by traversing the list only once.

Split nodes of the given linked list into front and back halves

Given a list, split it into two sublists – one for the front half, and one for the back half. If the number of elements is odd, the extra element should go in the front list.

Given a linked list, write a function to rearrange its nodes so they are sorted in increasing order. In other words, sort linked list.

Insert given node into the correct sorted position in the given sorted linked list

Given a list that is sorted in increasing order, and a single node, insert the node into the correct sorted position in the given list. The function should take an existing node, and just rearranges pointers to insert it into the list.

Write a Pop() function that is the inverse of Push(). Pop() takes a non-empty list, deletes the head node, and returns the head node’s data.

Write a function that takes a linked list, deallocates all of its memory and sets its head pointer to nullptr (the empty list).

Write a function that takes a singly linked list and returns a complete copy of that list.

We have discussed about the linked list data structure which is dynamic in nature (the memory is allocated during the run time). Now the question that might be on a few peoples minds is – can a linked link be implemented statically as well? This post tries to answer this question.

Implement Linked List | Insertion at the tail

In the previous two posts (here and here), we have introduced linked list data structure and discussed about various types of linked lists.. We also covered in great detail the various methods to construct a linked list which inserts every new node onto the front of the list. In this post, we will discuss various …