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


GNU libavl 2.0.1

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

9.3 Operations

Now we'll implement all the usual operations for TAVL trees. We can reuse everything from TBSTs except insertion, deletion, and copy functions. Most of the copy function code will in fact be reused also. Here's the outline:

 
&#60;@xref{\NODE\, , TBST creation function; tbst =>.&#62; tavl,252}
&#60;@xref{\NODE\, , TBST search function; tbst =>.&#62; tavl,253}
&#60;@xref{\NODE\, , TAVL item insertion function.&#62;,301}
&#60;@xref{\NODE\, , Table insertion convenience functions; tbl =>.&#62; tavl,592}
&#60;@xref{\NODE\, , TAVL item deletion function.&#62;,311}
&#60;@xref{\NODE\, , TBST traversal functions; tbst =>.&#62; tavl,268}
&#60;@xref{\NODE\, , TAVL copy function.&#62;,329}
&#60;@xref{\NODE\, , TBST destruction function; tbst =>.&#62; tavl,281}
&#60;@xref{\NODE\, , Default memory allocation functions; tbl =>.&#62; tavl,6}
&#60;@xref{\NODE\, , Table assertion functions; tbl =>.&#62; tavl,594}
This code is included in @refalso{298


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