What it does
In an AVL tree, the heights of the two child subtrees of any node differ by at most one. If, at any time during insertion or deletion, this condition is violated, rebalancing is performed to restore the property. The balancing is done by rotating the tree around certain nodes.
Built With
- cpp
Log in or sign up for Devpost to join the conversation.