AVL Trees

More Magazines

Recommendations

Info

AVL Tree Definition (§ 9.2) AVL trees are balanced. An AVL Tree is a binary search tree such that for every internal node v of T, the heights of the children of v can differ by at most 1. © 2004 Goodrich, Tamassia 2 4 44 3 17 78 1 2 32 50 1 1 48 62 An example of an AVL tree where the heights are shown next to the nodes: AVL Trees 2 88 1
Height of an AVL Tree Fact: The height of an AVL tree storing n keys is O(log n). Proof: Let us bound n(h): the minimum number of internal nodes of an AVL tree of height h. We easily see that n(1) = 1 and n(2) = 2 For n > 2, an AVL tree of height h contains the root node, one AVL subtree of height n-1 and another of height n-2. That is, n(h) = 1 + n(h-1) + n(h-2) Knowing n(h-1) > n(h-2), we get n(h) > 2n(h-2). So n(h) > 2n(h-2), n(h) > 4n(h-4), n(h) > 8n(n-6), … (by induction), n(h) > 2 i n(h-2i) Solving the base case we get: n(h) > 2 h/2-1 Taking logarithms: h < 2log n(h) +2 Thus the height of an AVL tree is O(log n) © 2004 Goodrich, Tamassia AVL Trees 3
Page 1: © 2004 Goodrich, Tamassia AVL Tree
Page 5 and 6: Trinode Restructuring T 0 let (a,b,
Page 7 and 8: Restructuring T0 T1 © 2004 Goodric
Page 9 and 10: Removal in an AVL Tree Removal begi
Page 11: Running Times for AVL Trees a singl

AVL Trees

Transform your PDFs into Flipbooks and boost your revenue!

Delete template?

Save as template ?