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


GNU libavl 2.0.1

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

6.3 Operations

Now we'll implement for AVL trees all the operations that we did for BSTs. Here's the outline. Creation and search of AVL trees is exactly like that for plain BSTs, and the generic table functions for insertion convenience, assertion, and memory allocation are still relevant, so we just reuse the code. Of the remaining functions, we will write new implementations of the insertion and deletion functions and revise the traversal and copy functions.

 
&#60;@xref{\NODE\, , BST creation function; bst =>.&#62; avl,30}
&#60;@xref{\NODE\, , BST search function; bst =>.&#62; avl,31}
&#60;@xref{\NODE\, , AVL item insertion function.&#62;,146}
&#60;@xref{\NODE\, , Table insertion convenience functions; tbl =>.&#62; avl,592}
&#60;@xref{\NODE\, , AVL item deletion function.&#62;,164}
&#60;@xref{\NODE\, , AVL traversal functions.&#62;,178}
&#60;@xref{\NODE\, , AVL copy function.&#62;,185}
&#60;@xref{\NODE\, , BST destruction function; bst =>.&#62; avl,84}
&#60;@xref{\NODE\, , Default memory allocation functions; tbl =>.&#62; avl,6}
&#60;@xref{\NODE\, , Table assertion functions; tbl =>.&#62; avl,594}
This code is included in @refalso{143


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