AVL trees are height-balanced binary search trees. This BST's nodes keep a balance factor by calculating the difference of their subtrees' heights. Height difference can no more than 1 else the tree has to rotate. Find, Insert, and Delete operation of an AVL tree takes O(log N) but deletions and insertions may require double rotations.
-
This project uses Google C++ Test Framework for its tests, you need to link gtest in order to be able to run the tests. (Psst! Do you want to know how to keep console open)
-
This project is coded and tested on Windows using Visual Studio without the intention of cross platform.
-
If you are not going to use tests then there shouldn't be any need for an external library.