14.6 Traversal [ToC] [Index]     [Skip Back] [Skip Fwd]     [Prev] [Up] [Next]

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.

548. <PAVL traversal functions 548> =
<TBST traverser null initializer; tbst => pavl 271>
<PBST traverser first initializer; pbst => pavl 505>
<PBST traverser last initializer; pbst => pavl 506>
<PBST traverser search initializer; pbst => pavl 507>
<TBST traverser insertion initializer; tbst => pavl 275>
<TBST traverser copy initializer; tbst => pavl 276>
<PBST traverser advance function; pbst => pavl 509>
<PBST traverser back up function; pbst => pavl 510>
<BST traverser current item function; bst => pavl 75>
<BST traverser replacement function; bst => pavl 76>

This code is included in 524 and 556.