This repository contains basic to intermediate Data Structures and Algorithms implemented in Python 3.0
-
- Linked List
- Stacks
- Queues
- Priority Queues
-
- Binary Search
- Bubble Sort
- Merge Sort
- Quick Sort
-
- Hash Map
-
- Depth first traversal
- Breadth first traversal
- Heaps
- Binary Search Tree
- Read-Black Trees
-
- Graph Representations
- Traversal
-
- Dijkstra's Algorithm
- Knapsack Problem
- Dynamic Programming
- Travelling Saleman Problem