This is a C++ AVL implementation with complexity guarantees.
Provides such useful methods as:
- Finding the closest element of a given item
- Performing 1 dimensional range queries, and
- Merging different trees together.
Follow Standard AVL C++
Rate This ProjectLogin To Rate This Project
Very dirty code! There are many issues and violations of standards of C++ language.