GNU libavl

GNU libavl is the most complete, well-documented collection of binary search tree and balanced tree library routines anywhere.
Download

GNU libavl Ranking & Summary

Advertisement

  • Rating:
  • License:
  • GPL
  • Price:
  • FREE
  • Publisher Name:
  • Ben Pfaff
  • Publisher web site:
  • http://www.stanford.edu/~blp/avl/

GNU libavl Tags


GNU libavl Description

GNU libavl is the most complete, well-documented collection of binary search tree and balanced tree library routines anywhere. GNU libavl is the most complete, well-documented collection of binary search tree and balanced tree library routines anywhere. The project supports these kinds of trees:Plain binary trees:· Binary search trees· AVL trees· Red-black treesThreaded binary trees:· Threaded binary search trees· Threaded AVL trees· Threaded red-black treesRight-threaded binary trees:· Right-threaded binary search trees· Right-threaded AVL trees· Right-threaded red-black treesBinary trees with parent pointers:· Binary search trees with parent pointers· AVL trees with parent pointers· Red-black trees with parent pointersWhat's New in This Release:· This release fixes a bug in tavl_delete().· This version (again) works with recent versions of Texinfo, fixes a few typos in the text, and slightly enhances the HTML output format.


GNU libavl Related Software

About SoftwareSea