AVL Tree & B Tree

AVL tree is a subtype of the binary search tree. AVL tree is a balanced tree which means the balance factor from the difference between the left node and right node is always 1,0,-1.