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


GNU libavl 2.0.1

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

14.5 Traversal

The traverser for a PBST is just like that for a TBST, so we can reuse a couple of the TBST functions. Besides that and a couple of completely generic functions, we have to reimplement the traversal functions.

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

14.5.1 Starting at the First Node  
14.5.2 Starting at the Last Node  
14.5.3 Starting at a Found Node  
14.5.4 Starting at an Inserted Node  
14.5.5 Advancing to the Next Node  
14.5.6 Backing Up to the Previous Node  


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