AVL tree is a self balancing binary search tree. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where n is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.
Clone the project. Run repl. JAVA 6 or later and leiningen required.
Copyright © 2016
Distributed under the Eclipse Public License either version 1.0 or (at your option) any later version.