Homemade C++ containers
If you intend to test this with any existing ft_containers tester, you will have to adjust their include path.
cplusplus.com cppreference.com ISO/IEC 14882
AVL Trees are balanced binary search trees, which means they perform rotations to keep their nodes balanced, allowing a complexity of for search, insertion and deletion.
The algorithm consists of checking the difference of height, called balance, between the two subtrees of a node. The balance must be between 1 and -1, otherwise the tree is becoming inefficient and must be rebalanced.
AVL Trees & Rotations (Self-Balancing Binary Search Trees)
AVL Tree Explained and Implemented in Java | AVL Trees Rotations | Self-Balancing Trees | Geekific — GitHub
Source: manuvai/AVL