Self-balanced Binary Search Trees with AVL

Binary Search Trees are used for many things that we might not be aware of. For instance: Website's databases use trees to search data more efficiently. HTML DOM elements are represented as a tree. For trees to be effective they need to be balanced.