Data Structures Important Programs - Chapter 1 - Using Linked list

[rajsathya]

Anna University , Chennai

Semester - 3

Data Structures

Important Programs - Chapter 1 - Using Linked list

Chapter 1 : Problem Solving Techniques 

Programs Attached ( All Using Linked List ) :

[ul][li]Program to maintain a linked list[/li][li]Program to add a new node to the ascending order linked list[/li][li]Program to reverse a linked list[/li][li]Program to merge two linked list, restricting common elements to occur only once[/li][li]Program to sort a linked list by swapping data[/li][li]Program to sort a linked list by readjusting the links[/li][li]Program to implement a circular queue as a linked list[/li][li]Program to concatenate one linked list at end of another and than to erase all nodes present in the linked list[/li][li]Program to find the number of nodes in the linked list using recursion[/li][li]Program to compare two linked lists using recursion[/li][li]Program to copy one linked list into another using recursion[/li][li]Program to add a new node at the end of linked list using recursion[/li][li]Program to maintain a doubly linked list[/li][li]Program to add two polynomials maintained as linked lists[/li][li]Program to multiply two polynomials maintained as linked lists.[/li][/ul]
Attachment :  
  data structures - Chapter 1 Linked List Imp Programs.pdf (Size: 406.44 KB / Downloads: 488)