- Graph Representation — Adjacency Matrix and Adjacency List
- Breadth-First Search/Traversal in a Graph.
- Merge a Linked list into another Linked List at Alternate Positions.
- Find the n’th Node from the end of a given Linked List
- Reverse The Doubly Linked List
- Merge or Combine Two Sorted Linked Lists
- Reverse a Linked List — Part 2
- Remove Duplicates from an Unsorted Linked list
- Circular Linked List Complete Implementation
- Reverse a Linked List in groups of given size ‘K’