Notebook contains minimal explanations and implementations for most common datastructures in python.
- Array
- Linked List
- Doubly Linked List
- Circular Linked List
- Stack
- Queue
- Bounded and Unbounded Priority Queue
- Hashmap
- Set
- Binary Tree
- Binary Search Tree
- Searching
- Linear Search
- Binary Search
- Interpolation Search
- Jump Search
- Sorting
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Tree Sort
- Graph
- Bread First Search
- Depth First Search
- Topological Sort