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.
546. <PAVL traversal functions 546> =
<TBST traverser null initializer; tbst => pavl 269>
<PBST traverser first initializer; pbst => pavl 503>
<PBST traverser last initializer; pbst => pavl 504>
<PBST traverser search initializer; pbst => pavl 505>
<TBST traverser insertion initializer; tbst => pavl 273>
<TBST traverser copy initializer; tbst => pavl 274>
<PBST traverser advance function; pbst => pavl 507>
<PBST traverser back up function; pbst => pavl 508>
<BST traverser current item function; bst => pavl 74>
<BST traverser replacement function; bst => pavl 75>
This code is included in 522 and 554.
14.5.4 Symmetric Case
|
14 AVL Trees with Parent Pointers
|
14.7 Copying
|