A complete guide to start with the basic data structure and go through some advance data structures.
Choosing the correct data structure or algorithm to solve a particular problem affects a lot on the efficiency of the solution.
-
Insertion of a node in singly linked list.
- at the beginning
- at the end
- at the specified position
-
Deletion of a node in singly linked list.
- from the beginning
- from the end
- from the specified position
-
- Method 1: Use Hashing
- Method 2: Floyd's cycle detection
-
Union and Intersection of two unsorted list
-
Union and Intersection of two sorted list
-
Flattening of a linked list