The AVL tree is a self-balancing binary tree. The operations take O(log n) time in average and worst cases, to ensure that, when inserting or deleting a node from the tree it uses tree rotations to restructure the tree.