- Dasar Algoritma
- Struktur Data
2.1. Linked List :
2.1.1. Singly Linked List
2.1.2. Double Linked List
2.1.3. Circular Linked List
2.2. Stack
2.2.1. Infix Notation
2.2.2. Prefix Notation
2.2.3. Postfix Notation
2.3. Queue
2.3.1. Linear Queue
2.3.2. Circular Queue
2.3.3. Double Ended Queue (Deque)
2.4. Tree, Binary Tree, dan Deep First Search (DFS) Tree Traversal
2.4.1. Full Binary Tree
2.4.2. Complete Binary Tree
2.4.3. Perfect Binary Tree
2.4.4. Binary Search Tree
2.4.5. In-order Traversal
2.4.6. Pre-order Traversal
2.4.7. Post-order Traversal
2.5. Heap
2.5.1. Min Heap
2.5.2. Max Heap
2.5.3. Heapify - Simple Sorting
3.1. Bubble Sort (normal dan optimal)
3.2. Selection Sort
3.3. Insertion Sort - Advance Sorting
4.1. Merge Sort
4.2. Quick Sort
4.3. Heap Sort (menggunakan Heapify) - Simple Searching
5.1. Linear Search - Advance Searching
6.1. Binary Search (iteratif dan rekursif)