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


GNU libavl 2.0.1

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

10.2 Operations

Now we'll implement all the usual operations for TRB trees. Here's the outline. We can reuse everything from TBSTs except insertion, deletion, and copy functions. The copy function is implemented by reusing the version for TAVL trees, but copying colors instead of balance factors.

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


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