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


GNU libavl 2.0.1

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

5.4 Operations

Now can start to implement the operations that we'll want to perform on BSTs. Here's the outline of the functions we'll implement. We use the generic table insertion convenience functions from Exercise 2.8-3 to implement bst_insert() and bst_replace(), as well the generic assertion function implementations from Exercise 2.9-2 to implement tbl_assert_insert() and tbl_assert_delete(). We also include a copy of the default memory allocation functions for use with BSTs:

 
&#60;@xref{\NODE\, , BST creation function.&#62;,30}
&#60;@xref{\NODE\, , BST search function.&#62;,31}
&#60;@xref{\NODE\, , BST item insertion function.&#62;,32}
&#60;@xref{\NODE\, , Table insertion convenience functions; tbl =>.&#62; bst,592}
&#60;@xref{\NODE\, , BST item deletion function.&#62;,37}
&#60;@xref{\NODE\, , BST traversal functions.&#62;,63}
&#60;@xref{\NODE\, , BST copy function.&#62;,83}
&#60;@xref{\NODE\, , BST destruction function.&#62;,84}
&#60;@xref{\NODE\, , BST balance function.&#62;,87}
&#60;@xref{\NODE\, , Default memory allocation functions; tbl =>.&#62; bst,6}
&#60;@xref{\NODE\, , Table assertion functions; tbl =>.&#62; bst,594}
This code is included in @refalso{25


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