balanced_binary_search_tree

AVL - Node-based self-balancing binary search tree data structure. The height difference of the left and right subtrees must not differ by more than one unit, that is, the balancing factor of each subtree must be -1,0 or 1.