www.delorie.com/gnu/docs/avl/libavl_156.html

search

	Buy GNU books!

GNU libavl 2.0.1

9.4 Insertion

Insertion into an AVL tree is not complicated much by the need to update threads. The outline is the same as before, and the code for step 3 and the local variable declarations can be reused entirely:

void ** tavl_probe (struct tavl_table *tree, void *item) { <@xref{\NODE\, , avl_probe.>() local variables; avl => tavl,147} assert (tree != NULL && item != NULL); <@xref{\NODE\, , Step 1: Search TAVL tree for insertion point.>,302} <@xref{\NODE\, , Step 2: Insert TAVL node.>,303} <@xref{\NODE\, , Step 3: Update balance factors after AVL insertion; avl =>.> tavl,150} <@xref{\NODE\, , Step 4: Rebalance after TAVL insertion.>,304} }

This code is included in @refalso{300

9.4.1 Steps 1 and 2: Search and Insert
9.4.2 Step 4: Rebalance
9.4.3 Symmetric Case