I coded my own version of the list, vector, and map containers from the c++ stl. The the source file of the solution tests my custom map and the stl map. The difference is that my map is coded as an avl tree rather than a red black tree. This means that the insert will be faster for my container however the find will be slower.