8.3 Operations [ToC] [Index]     [Skip Back] [Skip Fwd]     [Prev] [Up] [Next]

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:

302. <TAVL functions 302> =
<TBST creation function; tbst => tavl 254>
<TBST search function; tbst => tavl 255>
<TAVL item insertion function 303>
<Table insertion convenience functions; tbl => tavl 594>
<TAVL item deletion function 313>
<TBST traversal functions; tbst => tavl 270>
<TAVL copy function 331>
<TBST destruction function; tbst => tavl 283>
<Default memory allocation functions; tbl => tavl 7>
<Table assertion functions; tbl => tavl 596>

This code is included in 300.