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
Enterprise-grade ITSM, for every business Icon
Enterprise-grade ITSM, for every business

Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.

Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
Try it 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

Korean, English

Intended Audience

Developers

Programming Language

C++, C

Related Categories

C++ Algorithms, C Algorithms

Registered

2007-07-17
Report inappropriate content