This repository has my own attempts at implementing standard data structures.
The purpose behind these was to prepare myself for my upcoming 'Data Structures and Algorithms' class. By being able to implement these manually, I wanted to get adept at recognizing when to use which data structure based on their internal workings and strengths. Not to mention, implementing these structures helps you understand the different, creative ways of looking at the same problems.
- Hashmap
- Stack
- Queue
- Deque
- Heap
- Binary Search Tree
- AVL Tree
- Trie
- Additional Exception classes
To use any of these structures, store the relevant file into the src folder of your own project folder. From there, you can directly call the relevant data structure and use it freely.