Skip to content
David McManamon edited this page Oct 20, 2017 · 9 revisions

Implementing AVL trees in Java

Many sites cover the rotations necessary for insert and delete however, that still offers several implementation choices such as:

Recursion or loops Store height or balance factor at each node Store parent references or not at each node

As of 2017 there are many c language implementations of AVL trees and few, usually only recursive implementations of AVL trees in Java. While the recursive solution is elegant, how does it compare in terms of performance to an iterative solution? This project has a variety of implementations where you can find the answer.

Clone this wiki locally