Linked List Data Structures and related programs
A linked list data structure consists of vertices(also called as
nodes) that are connected to
other nodes
via edges or links.
A linked list is a linear type of data structure.
Linked list nodes have uni-directional edges/links that point to
other nodes.
For e.g. you can imagine a queue of people at a ticket counter
being represented as a linked
list.
Linked List Programs
- Sort a linked list
- Clone a Linked List
- Find the nth node from the end of a linked list
- Find the intersection of two linked list
- Detect if cycle is present in a linked list
- Insert a node into a linked list
- Check if linked list nodes form a palindrome
- Merge two sorted linked list
- Reverse a linked list - Recursive approach
- Find the length of linked list
- Implement a stack using linked list
- Reverse a linked list - Iterative approach
- Swap two given nodes of a linked list
- Find the nth node in a linked list using recursive approach
- Find the nth node in a linked list using iterative approach
- Delete a node at specific position from linked list
- Delete a node from linked list
- Insert a node after a given node into the linked list
- Pairwise swap nodes of a linked list
- Find the middle of linked list with odd no of nodes