Given two linked list with Node values sorted in ascending order. Write function that accepts these two linked lists, merge them and return pointer to merged list. In the process Original lists should be deleted (the pointer to head of original lists should be set to NULL)
Given a singly linked list, write a function which will search for a value in the list. Signature of the function will be as shown below: bool search(Node*head, int x); head points to the first Node in the list. The function should return true is x is present in the list as false.
Given a pointer to Node in a Singly linked list. Is it possible to delete the same node ?
Given a linked list, write code to split it into two lists each containing the alternate (odd-even) nodes from the original. If the original list is The It should split into two lists like below To make the final output look like (breaking the original list in two sublists)
Write a function which will accept a pointer to the head of the linked list and returns a pointer to the middle node of the list. If the list given is 2 -> 3 -> 5 -> 1 -> 4 -> 8 -> 10 Then the function should return a pointer to Node with value 1. […]
Write a recursive function to print the Linked list in reverse order …