# AVLTree

An AVL tree is a self-balancing binary search tree. It has a worst time complexity for insert, find and delete of $\mathcal{O}(\log n)$