AVL Tree

A generic AVL binary tree implementation which supports insertion, deletion and lookup in log(n) time. The self balancing algorithm checks whether two subtrees of a node differ in height by more than 1, and if so, rotate the node accordingly.