This is an avl tree implementation. It is implemented in very optimized way and easy to use. It does not force you to use any specific way of memory allocation. It does not use recursive call. It is implemented with emphasis on speed and simplicity.

Project Activity

See All Activity >

Categories

Algorithms

License

GNU Library or Lesser General Public License version 2.0 (LGPLv2)

Follow avl tree

avl tree Web Site

Other Useful Business Software
Build AI Apps with Gemini 3 on Vertex AI Icon
Build AI Apps with Gemini 3 on Vertex AI

Access Google’s most capable multimodal models. Train, test, and deploy AI with 200+ foundation models on one platform.

Vertex AI gives developers access to Gemini 3—Google’s most advanced reasoning and coding model—plus 200+ foundation models including Claude, Llama, and Gemma. Build generative AI apps with Vertex AI Studio, customize with fine-tuning, and deploy to production with enterprise-grade MLOps. New customers get $300 in free credits.
Try Vertex AI Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of avl tree!

Additional Project Details

Languages

English, Korean

Intended Audience

Developers

Programming Language

C, C++

Related Categories

C++ Algorithms, C Algorithms

Registered

2007-07-17
Report inappropriate content