6498 typo in libavl(3LIB) man page
Reviewed by: Marcel Telka <marcel@telka.sk>
Reviewed by: Yuri Pankov <yuri.pankov@nexenta.com>

@@ -9,11 +9,11 @@
 .\" http://www.illumos.org/license/CDDL.
 .\"
 .\"
 .\" Copyright 2015 Joyent, Inc.
 .\"
-.Dd May 07, 2015
+.Dd Dec 04, 2015
 .Dt LIBAVL 3LIB
 .Os
 .Sh NAME
 .Nm libavl
 .Nd generic self-balancing binary search tree library

@@ -82,11 +82,11 @@
 .It Sy Delete All Nodes
 .Bd -filled -compact
 Deleting all nodes from a linked list is
 .Sy O(n) .
 With an AVL tree, if using the
-.Xr avl_delete_nodes 3AVL
+.Xr avl_destroy_nodes 3AVL
 function then deleting all nodes
 is
 .Sy O(n) .
 However, if iterating over each entry in the tree and then removing it using
 a while loop,