An overview of AVL trees, a type of self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one