AVL Tree
========

AVL trees are a type of self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one. If they differ by more than one at any time, rebalancing is performed to restore this property.


.. automodule:: trees.binary_trees.avl_tree
   :members: