Some example implementations of data Structures, coded in C++ The idea is not to give usable structures, but just examples on how you can change the implementations while working with the same interface. Doing this, you can try different approaches on how to store data and how the classes behave, without breaking existing code. Sometimes, you need fast random access, sometimes you need sequential access, or be able to sort efficiently. Depending on how you're going to USE your data structure, you have to CHOOSE the right implementation. To run the tests, you'll need gtest: http://code.google.com/p/googletest/ deb packages are available for Debian derivatives: libgtest0, libgtest-dev
zincxenon/cpp-datastructures
Some example implementations of different Data Structures, coded in C++
C++