As usual, we must reimplement the item insertion and deletion
functions. The tree copy function and some of the traversal functions
also need to be rewritten.
522. <PAVL functions 522> =
<TBST creation function; tbst => pavl 252>
<BST search function; bst => pavl 31>
<PAVL item insertion function 523>
<Table insertion convenience functions; tbl => pavl 592>
<PAVL item deletion function 534>
<PAVL traversal functions 546>
<PAVL copy function 547>
<BST destruction function; bst => pavl 84>
<Default memory allocation functions; tbl => pavl 6>
<Table assertion functions; tbl => pavl 594>
This code is included in 520.
14.2 Rotations
|
14 AVL Trees with Parent Pointers
|
14.4 Insertion
|