Print this page
6498 typo in libavl(3LIB) man page
Reviewed by: Marcel Telka <>
Reviewed by: Yuri Pankov <>

@@ -52,11 +52,11 @@
              Deleting a single node from a linked list is O(1), whereas
              deleting a single node from an AVL tree takes O(log(n)) time.
      Delete All Nodes
              Deleting all nodes from a linked list is O(n).  With an AVL tree,
-             if using the avl_delete_nodes(3AVL) function then deleting all
+             if using the avl_destroy_nodes(3AVL) function then deleting all
              nodes is O(n).  However, if iterating over each entry in the tree
              and then removing it using a while loop, avl_first(3AVL) and
              avl_remove(3AVL) then the time to remove all nodes is
              O(n * log(n)).

@@ -364,6 +364,6 @@
      Adel'son-Vel'skiy, G. M. and Landis, Ye. M., An Algorithm for the
      Organization of Information, No. 2, Vol. 16, 263-266, Deklady Akademii
      Nauk, USSR, Moscow, 1962.
-illumos                           May 7, 2015                          illumos
+illumos                        December 4, 2015                        illumos