AVL tree noun1 •A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one. formsAVL trees