AVL Trees.ppt

AVL Trees CSE, POSTECH Balanced Binary Search Trees If the height of a binary tree is always O(log n), we can guarantee O(log n) performance for each search tree operation Trees with a worst-case height of O(log n) are called balanced trees An example of a balanced tree is AVL (Adelson-Velsky and Landis) tree AVL Tree Definition Binary tree. If T is a nonempty binary tree with TL and TR as its left and right subtrees, then T is an AVL tree iff TL and TR are AVL trees, and |hL – hR| ? 1 where hL and hR are the heights of TL and TR, respectively AVL Search Trees An AVL search tree is a binary search tree that is also an AVL tree Which trees in Figure 14.1 are AVL trees? (a) and (b) Which trees in Figure 14.1 are AVL search trees? (b) only Which trees in Figure 14.3 are AVL search trees? (a) and (b) Indexed AVL Search Trees An indexed AVL search tree is an indexed binary search tree that is also an AVL tree Which trees in Figure 14.2 are indexed AVL trees? (a) and (b) Which trees in Figure 14.2 are indexed AVL search trees? (a) and (b) Properties of AVL Tree The height of an AVL tree with n nodes is O(log n) For every value of n, n ? 0, there exists an AVL tree An n-node AVL search tree can be searched in O(height) = O(log n) time A new node can be inserted into an n-node AVL search tree so that the result is an n+1 node AVL tree and insertion can be done in O(log n) time A node can be deleted from an n-node AVL search tree, n0, so that the result is an n-1 node AVL tree and deletion can be done in O(log n) time Balance Factor AVL trees are normally represented using the linked representation To facilitate insertion and deletion, a balance factor (bf) is associated with each node The balance factor bf(x) of a node x is defined as height(x?leftChild) – height(x?rightChild) Balance factor of each node in an AVL tree must be –1, 0, or 1 See Figure 15.1 for examples AVL Tree with Balance Factors Is this an AVL tree? What is the balance factor for each node in this A