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


GNU libavl 2.0.1

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

16.2 Operations

Most of the PRB operations use the same implementations as did PAVL trees in the last chapter. The PAVL copy function is modified to copy colors instead of balance factors. The item insertion and deletion functions must be newly written, of course.

 
&#60;@xref{\NODE\, , TBST creation function; tbst =>.&#62; prb,252}
&#60;@xref{\NODE\, , BST search function; bst =>.&#62; prb,31}
&#60;@xref{\NODE\, , PRB item insertion function.&#62;,555}
&#60;@xref{\NODE\, , Table insertion convenience functions; tbl =>.&#62; prb,592}
&#60;@xref{\NODE\, , PRB item deletion function.&#62;,566}
&#60;@xref{\NODE\, , PAVL traversal functions; pavl =>.&#62; prb,546}
&#60;@xref{\NODE\, , PAVL copy function; pavl =>.&#62; prb; pavl_balance => prb_color,547}
&#60;@xref{\NODE\, , BST destruction function; bst =>.&#62; prb,84}
&#60;@xref{\NODE\, , Default memory allocation functions; tbl =>.&#62; prb,6}
&#60;@xref{\NODE\, , Table assertion functions; tbl =>.&#62; prb,594}
This code is included in @refalso{552


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