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


GNU libavl 2.0.1

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

13.2 Operations

Most of the operations on RTRB trees can be borrowed from the corresponding operations on TBSTs, RTBSTs, or RTAVL trees, as shown below.

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


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