- LinkedLists
- Singly-LinkedList
- Doubly-LinkedList
- Circular-Singly-LinkedList
- Circular-Double-LinkedList
- Stacks
- Array-Based Implementation
- LinkedList-Based Implementation
- Queues
- Simple Queue
- Array-Based Implementation
- LinkedList-Based Implementation
- Circular Queue
- Array-Based Implementation
- LinkedList-Based Implementation
- Double-Ended Queue
- Array-Based Implementation
- LinkedList-Based Implementation
- Priority Queue
- Array-Based Implementation (Pending: Python Code)
- LinkedList-Based Implementation
- Heap-Based Implementation
- Binary Search Tree-Based Implementation
- Hash Tables
- Array-Based (Simple)
- Heaps
- Simple Heaps
- Fibonacci Heaps
- Trees
- Simple Tree
- Binary Trees
- Simple Binary Tree
- Full Binary Tree
- Perfect Binary Tree
- Complete Binary Tree
- Balanced Binary Tree
- Binary Search Tree
- AVL Tree
- B Tree
- B+ Tree
- Red-Black Tree
- Graphs
- Searching Algorithms
- Binary Search
- Sorting Algorithms
- Selection Sort
- Merge Sort
- Insertion Sort
- Quick Sort
- Simple Queue