Project Description
Self balancing AVL tree with Concat and Split operations.

Self balancing AVL tree that provides Concatenate and Split operations plus the usual: Add, Delete, Search, Min, Max, DeleteMin, DeleteMax .. (all logarithmic time)

Can be easily ported to C++.

Can be used with or without parent pointers/references. Traversal is currently implemented using parent pointers.

Last edited Aug 14, 2012 at 11:56 AM by costinul, version 2