Explanation for the Merge sort
Preorder Traversal in a Binary Tree (With C Code)
Asymptotic Notations: Big O, Big Omega and Big Theta Explained (With Notes)
Creating a Single Linked List (Part 1)
2.16 Circular linked list - Insertion | data structure
2.11 Insertion in Doubly Linked List(beginning, end, specific position) - Data Structures