Linked List

A linked list is a linear data structure where each element is a separate object. Linked list elements are not stored at contiguous location, the elements are linked using pointers. Each node of a list is made up of two items - the data and a reference to the next node. The last node has a reference to null.

Theory

 
1. Linked List

2. Polynomial Operations using Linked List

 

Single Linked List

 
1. Single Linked List
 
2. Single Linked List with Header Node
 

3. Concatenate Two Single Linked List

 

Doubly Linked List 

1. Doubly Linked List

 

Circular Linked List

1. Circular Linked List
 

2. Concatenate Two Circular Linked Lists

 

Sorted Linked List

 
1. Sorted Linked List

2. Merging Two Sorted Linked Lists

 

Linked List & Recursion 

1. Linked List and Recursion

 

Stack using Linked List

1. Stack using Linked List 

 

Queue using Linked List

1. Queue using Linked List

2. Queue using Circular Linked List

3. Priority Queue using Linked List

 

Polynomial Operations - Addition, Subtraction, Multiplication & Division

1. Polynomial Addition using Linked List

2. Polynomial Subtraction using Linked List

3. Polynomial Multiplication using Linked List

4. Polynomial Addition and Multiplication using Linked List

Sorting using Linked List

1. Sorting a Single Linked List