Binary search trees provide O(lg n) performance on average for important operations such as item insertion, deletion, and search operations. Balanced trees provide O(lg n) even in the worst case.
GNU libavl is the most complete, well-documented collection of binary search tree and balanced tree library routines anywhere. It supports these kinds of trees:
- Plain binary trees:
- Binary search trees
- AVL trees
- Red-black trees
- Threaded binary trees:
- Threaded binary search trees
- Threaded AVL trees
- Threaded red-black trees
- Right-threaded binary trees:
- Right-threaded binary search trees
- Right-threaded AVL trees
- Right-threaded red-black trees
- Binary trees with parent pointers:
- Binary search trees with parent pointers
- AVL trees with parent pointers
- Red-black trees with parent pointers
Top 4 Download periodically updates information of GNU libavl script from the developer, but some information may be slightly out-of-date.
Our script download links are directly from our mirrors or publisher's website. GNU libavl torrent files or shared files from free file sharing and free upload services, including Rapidshare, MegaUpload, YouSendIt, MailBigFile, DropSend, HellShare, HotFile, FileServe, MediaMax, zUpload, MyOtherDrive, SendSpace, DepositFiles, Letitbit, LeapFile, DivShare or MediaFire, are not allowed!
Free Download
