- Data Structure Introduction
- Data Structure Types
- Data Structure Arrays
- Singly Linked List
- Bubble Sort
- Binary Tree
- Binary Search Tree
- Array vs Linked List
- Stack vs Queue
- Binary Tree vs Binary Search Tree
- Queues
- Lenear Search
- Binary Search
- Stack
- Merge Sort
- Heap Sort
- Quick Sort
- Doubly Linked List
- Cirular Linked List
- Circular Queue
- Avl Tree
- Bucket Sort
- Selection Sort
- Insertion Sort
Merge Sort.
Merge sort is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative order of equal elements is the same in the input and output.