Scribd
Upload
41 views1 page

Data Structures (Lab) Assignment-2 (Linked List-1)

This document outlines 8 assignments for a data structures lab involving various types of linked lists: implementing a standard linked list with operations like insertion and deletion; a circular linked list; header linked list; header based circular linked list; doubly linked list; circular doubly linked list; header doubly linked list; and header based circular doubly linked list.

Uploaded by

Krishna sah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views1 page

Data Structures (Lab) Assignment-2 (Linked List-1)

This document outlines 8 assignments for a data structures lab involving various types of linked lists: implementing a standard linked list with operations like insertion and deletion; a circular linked list; header linked list; header based circular linked list; doubly linked list; circular doubly linked list; header doubly linked list; and header based circular doubly linked list.

Uploaded by

Krishna sah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Data Structures (Lab)

Assignment-2 (Linked List-1)


1. WAP to implement Linked List.
a. Create a linked list.
b. Insert an element at the start of the linked list.
c. Insert an element at the end of the linked list.
d. Insert an element before an existing element whose information is x in a linked list.
e. Insert an element after an existing element whose information is x in a linked list.
f. Delete the first element of the linked list.
g. Delete the last element of the linked list.
h. Delete the element whose information is x from a linked list.
i. Display the contents of the linked list.
2. WAP to implement Circular Linked List.
3. WAP to implement Header Linked List.
4. WAP to implement Header based Circular Linked List.
5. WAP to implement Doubly Linked List.
6. WAP to implement Circular Doubly Linked List.
7. WAP to implement Header Doubly Linked List.
8. WAP to implement Header based Circular Doubly Linked List.

You might also like