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


GNU libavl 2.0.1

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

8.3 Operations

Now that we've changed the basic form of our binary trees, we have to rewrite most of the tree functions. A function designed for use with unthreaded trees will get hopelessly lost in a threaded tree, because it will follow threads that it thinks are child pointers. The only functions we can keep are the totally generic functions defined in terms of other table functions.

 
&#60;@xref{\NODE\, , TBST creation function.&#62;,252}
&#60;@xref{\NODE\, , TBST search function.&#62;,253}
&#60;@xref{\NODE\, , TBST item insertion function.&#62;,254}
&#60;@xref{\NODE\, , Table insertion convenience functions; tbl =>.&#62; tbst,592}
&#60;@xref{\NODE\, , TBST item deletion function.&#62;,257}
&#60;@xref{\NODE\, , TBST traversal functions.&#62;,268}
&#60;@xref{\NODE\, , TBST copy function.&#62;,278}
&#60;@xref{\NODE\, , TBST destruction function.&#62;,281}
&#60;@xref{\NODE\, , TBST balance function.&#62;,282}
&#60;@xref{\NODE\, , Default memory allocation functions; tbl =>.&#62; tbst,6}
&#60;@xref{\NODE\, , Table assertion functions; tbl =>.&#62; tbst,594}
This code is included in @refalso{248


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