Self-balancing binary search tree implementation in C++ based on AVL tree. Completed as a part of Faculty of Computer Science 'Introduction to Programming (advanced group)' course at Higher School of Economics.
Works with any classes with defined less than operator < (has to be a strict partial order).