Click here to Skip to main content
11,641,971 members (61,932 online)
Click here to Skip to main content
Articles » Languages » C / C++ Language » General » Alternatives

Addison-Velski and Landis (AVL) Binary Trees

, 22 Feb 2000 70.5K 1.6K 31
Describes an implementation of AVL Trees.


Members may post updates or alternatives to this current article in order to show different approaches or add new features.

No alternatives have been posted.


This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here


About the Author

Andreas Jäger
Web Developer
Germany Germany
No Biography provided

| | Privacy | Terms of Use | Mobile
Web03 | 2.8.150731.1 | Last Updated 23 Feb 2000
Article Copyright 2000 by Andreas Jäger
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid