Write algorithms for the following : 2×5=10 (i) Split the singly link…
Previous year question for Data Structures.
Question
Write algorithms for the following : 2×5=10
(i) Split the singly linked list at the middle and make the second half as the first and vice-versa.
(ii) Delete all nodes from doubly linked list with value less than the value in the first node of the doubly linked list.
- Year: 2018
- Subject: Data Structures
Related pages
More PYQs on Linear Linked Lists
- a) Define the terms : static and dynamic data structures. List some of the static and dynamic data structure in C. (10) b) What is traversing? Write an algorit…
- (a) Given pointers L 1 and L 2 of two sorted singly linked lists of integers. The lists may have some common elements. Write an algorithm to create a new sorte…