Make your own free website on Tripod.com

AVL Trees

Height balanced binary search trees: Height < 1.5logN

Search, Insertion, Deletion are guaranteed O(logN) provided height balance can be maintained in O(logN). It can!

Operations must preserve:

Insertion: