www.delorie.com/gnu/docs/avl/libavl_245.html   search  
 
Buy GNU books!


GNU libavl 2.0.1

[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [ ? ]

15.3 Operations

As usual, we must reimplement the item insertion and deletion functions. The tree copy function and some of the traversal functions also need to be rewritten.

 
&#60;@xref{\NODE\, , TBST creation function; tbst =>.&#62; pavl,252}
&#60;@xref{\NODE\, , BST search function; bst =>.&#62; pavl,31}
&#60;@xref{\NODE\, , PAVL item insertion function.&#62;,523}
&#60;@xref{\NODE\, , Table insertion convenience functions; tbl =>.&#62; pavl,592}
&#60;@xref{\NODE\, , PAVL item deletion function.&#62;,534}
&#60;@xref{\NODE\, , PAVL traversal functions.&#62;,546}
&#60;@xref{\NODE\, , PAVL copy function.&#62;,547}
&#60;@xref{\NODE\, , BST destruction function; bst =>.&#62; pavl,84}
&#60;@xref{\NODE\, , Default memory allocation functions; tbl =>.&#62; pavl,6}
&#60;@xref{\NODE\, , Table assertion functions; tbl =>.&#62; pavl,594}
This code is included in @refalso{520


  webmaster   donations   bookstore     delorie software   privacy  
  Copyright 2003   by The Free Software Foundation     Updated Jun 2003