GNU libavl 2.0.1
Author: Ben Pfaff

8.3 Operations |

Now we'll implement all the usual operations for TAVL trees. We can reuse everything from TBSTs except insertion, deletion, and copy functions. Most of the copy function code will in fact be reused also. Here's the outline:

    300. <TAVL functions 300> =
    <TBST creation function; tbst => tavl 252>
    <TBST search function; tbst => tavl 253>
    <TAVL item insertion function 301>
    <Table insertion convenience functions; tbl => tavl 592>
    <TAVL item deletion function 311>
    <TBST traversal functions; tbst => tavl 268>
    <TAVL copy function 329>
    <TBST destruction function; tbst => tavl 281>
    <Default memory allocation functions; tbl => tavl 6>
    <Table assertion functions; tbl => tavl 594>

This code is included in 298.

8.2 Rotations | 8 Threaded AVL Trees | 8.4 Insertion