GNU libavl 2.0.1
Author: Ben Pfaff

15.2 Operations |

Most of the PRB operations use the same implementations as did PAVL trees in the last chapter. The PAVL copy function is modified to copy colors instead of balance factors. The item insertion and deletion functions must be newly written, of course.

    554. <PRB functions 554> =
    <TBST creation function; tbst => prb 252>
    <BST search function; bst => prb 31>
    <PRB item insertion function 555>
    <Table insertion convenience functions; tbl => prb 592>
    <PRB item deletion function 566>
    <PAVL traversal functions; pavl => prb 546>
    <PAVL copy function; pavl => prb; pavl_balance => prb_color 547>
    <BST destruction function; bst => prb 84>
    <Default memory allocation functions; tbl => prb 6>
    <Table assertion functions; tbl => prb 594>

This code is included in 552.

15.1 Data Types | 15 Red-Black Trees with Parent Pointers | 15.3 Insertion