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

GNU libavl 2.0.1

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

12.2 Operations

Most of the operations for RTAVL trees can come directly from their RTBST implementations. The notable exceptions are, as usual, the insertion and deletion functions. The copy function will also need a small tweak. Here's the list of operations:

 
&#60;@xref{\NODE\, , TBST creation function; tbst =>.&#62; rtavl,252}
&#60;@xref{\NODE\, , RTBST search function; rtbst =>.&#62; rtavl,376}
&#60;@xref{\NODE\, , RTAVL item insertion function.&#62;,419}
&#60;@xref{\NODE\, , Table insertion convenience functions; tbl =>.&#62; rtavl,592}
&#60;@xref{\NODE\, , RTAVL item deletion function.&#62;,429}
&#60;@xref{\NODE\, , RTBST traversal functions; rtbst =>.&#62; rtavl,395}
&#60;@xref{\NODE\, , RTAVL copy function.&#62;,447}
&#60;@xref{\NODE\, , RTBST destruction function; rtbst =>.&#62; rtavl,407}
&#60;@xref{\NODE\, , Default memory allocation functions; tbl =>.&#62; rtavl,6}
&#60;@xref{\NODE\, , Table assertion functions; tbl =>.&#62; rtavl,594}
This code is included in @refalso{416


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