I’m curently taking a class called Data Structures and Algorithms. I decided I’d try to implement some common data structures of my own.
These structures are mostly being built in a linked list style with the exception of the List struct which is built on an array that will auto-resize. You might ask, “why are you doing this, when there are already templated vectors and maps and such in the STL?” Mainly because I can!! I enjoy these things, and I wanted to try my hand at some of the most commonly used structures, but also I wanted to make them template based so that they are generic enough to be reusable in my other projects.
Currently, I have the following structures done:
- List
- Queue
- Stack
And the following are planned:
- Heap
- Red-Black Tree
- Binary Search Tree
- Others???
I’ll keep adding to them hopefully until I have a whole set of generic data structures to use. If you’re interested in the code or usage, hop over to my GitHub account to see the project code and some examples. I hope to keep adding useful examples to the repository little by little. Thanks for reading!!
