AVL Trees

What they are and how they work!

• A self balencing binary search tree
• To be balenced, difference of the left and right subtrees on any node has be -1, 0, or 1
• AVL trees are best used when you don't want to insert information in often, but will search the tree a lot