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


GNU libavl 2.0.1

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

15.6 Traversal

The only difference between PAVL and PBST traversal functions is the insertion initializer. We use the TBST implementation here, which performs a call to pavl_probe(), instead of the PBST implementation, which inserts the node directly without handling node colors.

 
&#60;@xref{\NODE\, , TBST traverser null initializer; tbst =>.&#62; pavl,269}
&#60;@xref{\NODE\, , PBST traverser first initializer; pbst =>.&#62; pavl,503}
&#60;@xref{\NODE\, , PBST traverser last initializer; pbst =>.&#62; pavl,504}
&#60;@xref{\NODE\, , PBST traverser search initializer; pbst =>.&#62; pavl,505}
&#60;@xref{\NODE\, , TBST traverser insertion initializer; tbst =>.&#62; pavl,273}
&#60;@xref{\NODE\, , TBST traverser copy initializer; tbst =>.&#62; pavl,274}
&#60;@xref{\NODE\, , PBST traverser advance function; pbst =>.&#62; pavl,507}
&#60;@xref{\NODE\, , PBST traverser back up function; pbst =>.&#62; pavl,508}
&#60;@xref{\NODE\, , BST traverser current item function; bst =>.&#62; pavl,74}
&#60;@xref{\NODE\, , BST traverser replacement function; bst =>.&#62; pavl,75}
This code is included in @refalso{522


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