Tree-AVL version 1.074
An implementation of an AVL tree for storing comparable objects.
AVL Trees are balanced binary trees, first introduced
in "An Algorithm for the Organization of Information" by
Adelson-Velskii and Landis in 1962.
Balance is kept in an AVL tree during insertion and
deletion by maintaining a 'balance' factor in each node.
If the subtree below any nod
Revision history for Perl extension Tree::AVL.
0.01 Thu Jan 1 12:46:43 2009
- original version; created by h2xs 1.23 with options
1.05 Sat Jul 11 12:57:00 2009
- Fixed a bug in largest() function, where recursive
invocation was called incorrectly (discovered by Robert Lehr)
- Modified get_list and get_list_recursive so that they behave
Browse inside Tree-AVL-1.074.tar.gz
Results 1 - 1 of 1Search over 15 billion files
© 1997-2016 FileWatcher.com