Presentation is loading. Please wait.

Presentation is loading. Please wait.

AVL Tree Smt Genap 2011-2012. Outline AVL Tree ◦ Definition ◦ Properties ◦ Operations Smt Genap 2011-2012.

Published byAmerica Ferry Modified over 9 years ago

Similar presentations

Presentation on theme: "AVL Tree Smt Genap 2011-2012. Outline AVL Tree ◦ Definition ◦ Properties ◦ Operations Smt Genap 2011-2012."— Presentation transcript:

1 AVL Tree Smt Genap 2011-2012

2 Outline AVL Tree ◦ Definition ◦ Properties ◦ Operations Smt Genap 2011-2012

3 AVL Trees Unbalanced Binary Search Trees are bad. Worst case: operations take O(n). AVL (Adelson-Velskii & Landis) trees maintain balance. For each node in tree, height of left subtree and height of right subtree differ by a maximum of 1. Smt Genap 2011-2012 XX H H-1 H-2

4 AVL Trees Smt Genap 2011-2012 10 5 3 20 2 13 10 5 3 20 1 43 5

5 AVL Trees Smt Genap 2011-2012 12 816 410 26 14

6 Insertion for AVL Tree After insert 1 Smt Genap 2011-2012 12 816 410 26 14 1

7 Insertion for AVL Tree To ensure balance condition for AVL-tree, after insertion of a new node, we back up the path from the inserted node to root and check the balance condition for each node. If after insertion, the balance condition does not hold in a certain node, we do one of the following rotations: ◦ Single rotation ◦ Double rotation Smt Genap 2011-2012

8 Insertions Causing Imbalance An insertion into the subtree: ◦ P (outside) - case 1 ◦ Q (inside) - case 2 An insertion into the subtree: ◦ Q (inside) - case 3 ◦ R (outside) - case 4 Smt Genap 2011-2012 R P Q k1k1 k2k2 Q k2k2 P k1k1 R H P =H Q =H R

9 Single Rotation (case 1) Smt Genap 2011-2012 A k2k2 B k1k1 C CB A k1k1 k2k2 H A =H B +1 H B =H C

10 Single Rotation (case 4) Smt Genap 2011-2012 C k1k1 B k2k2 A AB C k2k2 k1k1 H A =H B H C =H B +1

11 Problem with Single Rotation Single rotation does not work for case 2 and 3 (inside case) Smt Genap 2011-2012 Q k2k2 P k1k1 R R P Q k1k1 k2k2 H Q =H P +1 H P =H R

12 Double Rotation: Step Smt Genap 2011-2012 C k3k3 A k1k1 D B k2k2 C k3k3 A k1k1 D B k2k2 H A =H B =H C =H D

13 Double Rotation: Step Smt Genap 2011-2012 C k3k3 A k1k1 D B k2k2

14 Double Rotation Smt Genap 2011-2012 C k3k3 A k1k1 D B k2k2 C k3k3 A k1k1 D B k2k2 H A =H B =H C =H D

15 Double Rotation Smt Genap 2011-2012 B k1k1 D k3k3 A C k2k2 B k1k1 D k3k3 A C k2k2 H A =H B =H C =H D

16 Example Insert 3 into the AVL tree Smt Genap 2011-2012 3 11 8 20 4 16 27 8 8 11 4 20 3 16 27

17 Example Insert 5 into the AVL tree Smt Genap 2011-2012 5 11 8 20 4 16 278 11 5 20 4 16 27 8

18 AVL Trees: Exercise Insertion order: ◦ 10, 85, 15, 70, 20, 60, 30, 50, 65, 80, 90, 40, 5, 55 Smt Genap 2011-2012

19 Remove Operation in AVL Tree Removing a node from an AVL Tree is the same as removing from a binary search tree. However, it may unbalance the tree. Similar to insertion, starting from the removed node we check all the nodes in the path up to the root for the first unbalance node. Use the appropriate single or double rotation to balance the tree. May need to continue searching for unbalanced nodes all the way to the root. Smt Genap 2011-2012

20 Deletion X in AVL Trees Deletion: ◦ Case 1: if X is a leaf, delete X ◦ Case 2: if X has 1 child, use it to replace X ◦ Case 3: if X has 2 children, replace X with its inorder predecessor (and recursively delete it) Rebalancing Smt Genap 2011-2012

21 Delete 55 (case 1) Smt Genap 2011-2012 60 2070 10406585 5153050 8090 55

22 Delete 55 (case 1) Smt Genap 2011-2012 60 2070 10406585 5153050 8090 55

23 Delete 50 (case 2) Smt Genap 2011-2012 60 2070 10406585 5153050 8090 55

24 Delete 50 (case 2) Smt Genap 2011-2012 60 2070 10406585 51530 50 8090 55

25 Delete 60 (case 3) Smt Genap 2011-2012 60 2070 10406585 5153050 8090 55 prev

26 Delete 60 (case 3) Smt Genap 2011-2012 55 2070 10406585 5153050 8090

27 Delete 55 (case 3) Smt Genap 2011-2012 55 2070 10406585 5153050 8090 prev

28 Delete 55 (case 3) Smt Genap 2011-2012 50 2070 10406585 51530 8090

29 Delete 50 (case 3) Smt Genap 2011-2012 50 2070 10406585 51530 8090 prev

30 Delete 50 (case 3) Smt Genap 2011-2012 40 2070 10306585 515 8090

31 Delete 40 (case 3) Smt Genap 2011-2012 40 2070 10306585 515 8090 prev

32 Delete 40 : Rebalancing Smt Genap 2011-2012 30 2070 106585 515 8090 Case ?

33 Delete 40: after rebalancing Smt Genap 2011-2012 30 7010 206585 5 15 8090 Single rotation is preferred!

34 Minimum Element in AVL Tree An AVL Tree of height H has at least F H+3 -1 nodes, where F i is the i-th fibonacci number S 0 = 1 S 1 = 2 S H = S H-1 + S H-2 + 1 Smt Genap 2011-2012 S H-1 S H-2 H H-1 H-2

35 AVL Tree: analysis (2) The depth of AVL Trees is at most logarithmic. So, all of the operations on AVL trees are also logarithmic. Smt Genap 2011-2012

36 Summary Find element, insert element, and remove element operations all have complexity O(log n) for worst case Insert operation: top-down insertion and bottom up balancing Smt Genap 2011-2012

37 Further Study Section 19.4 of Weiss book Smt Genap 2011-2012

Download ppt "AVL Tree Smt Genap 2011-2012. Outline AVL Tree ◦ Definition ◦ Properties ◦ Operations Smt Genap 2011-2012."

Similar presentations

COSC 2007 Data Structures II Chapter 12 Advanced Implementation of Tables II.

COSC 2007 Data Structures II Chapter 12 Advanced Implementation of Tables II.
AVL Trees1 Part-F2 AVL Trees 6 3 8 4 v z. AVL Trees2 AVL Tree Definition (§ 9.2) AVL trees are balanced. An AVL Tree is a binary search tree such that.

AVL Trees1 Part-F2 AVL Trees v z. AVL Trees2 AVL Tree Definition (§ 9.2) AVL trees are balanced. An AVL Tree is a binary search tree such that.
AVL Trees1 Part-F2 AVL Trees 6 3 8 4 v z. AVL Trees2 AVL Tree Definition (§ 9.2) AVL trees are balanced. An AVL Tree is a binary search tree such that.

AVL Trees1 Part-F2 AVL Trees v z. AVL Trees2 AVL Tree Definition (§ 9.2) AVL trees are balanced. An AVL Tree is a binary search tree such that.
1 AVL-Trees (Adelson-Velskii & Landis, 1962) In normal search trees, the complexity of find, insert and delete operations in search trees is in the worst.

1 AVL-Trees (Adelson-Velskii & Landis, 1962) In normal search trees, the complexity of find, insert and delete operations in search trees is in the worst.
CPSC 252 AVL Trees Page 1 AVL Trees Motivation: We have seen that when data is inserted into a BST in sorted order, the BST contains only one branch (it.

CPSC 252 AVL Trees Page 1 AVL Trees Motivation: We have seen that when data is inserted into a BST in sorted order, the BST contains only one branch (it.
AVL Trees COL 106 Amit Kumar Shweta Agrawal Slide Courtesy : Douglas Wilhelm Harder, MMath, UWaterloo

AVL Trees COL 106 Amit Kumar Shweta Agrawal Slide Courtesy : Douglas Wilhelm Harder, MMath, UWaterloo
CS261 Data Structures AVL Trees. Goals Pros/Cons of a BST AVL Solution – Height-Balanced Trees.

CS261 Data Structures AVL Trees. Goals Pros/Cons of a BST AVL Solution – Height-Balanced Trees.
Trees Types and Operations

Trees Types and Operations
IKI 10100: Data Structures & Algorithms Ruli Manurung (acknowledgments to Denny & Ade Azurat) 1 Fasilkom UI Ruli Manurung (Fasilkom UI)IKI10100: Lecture27.

IKI 10100: Data Structures & Algorithms Ruli Manurung (acknowledgments to Denny & Ade Azurat) 1 Fasilkom UI Ruli Manurung (Fasilkom UI)IKI10100: Lecture27.
Time Complexity of Basic BST Operations Search, Insert, Delete – These operations visit the nodes along a root-to- leaf path – The number of nodes encountered.

Time Complexity of Basic BST Operations Search, Insert, Delete – These operations visit the nodes along a root-to- leaf path – The number of nodes encountered.
AVL Trees CS II – Fall 2010 9/8/2010. Announcements HW#2 is posted – Uses AVL Trees, so you have to implement an AVL Tree class. Most of the code is provided.

AVL Trees CS II – Fall /8/2010. Announcements HW#2 is posted – Uses AVL Trees, so you have to implement an AVL Tree class. Most of the code is provided.
CS202 - Fundamental Structures of Computer Science II

CS202 - Fundamental Structures of Computer Science II
TCSS 342 AVL Trees v1.01 AVL Trees Motivation: we want to guarantee O(log n) running time on the find/insert/remove operations. Idea: keep the tree balanced.

TCSS 342 AVL Trees v1.01 AVL Trees Motivation: we want to guarantee O(log n) running time on the find/insert/remove operations. Idea: keep the tree balanced.
1 Balanced Search Trees  several varieties  AVL trees  2-3-4 trees  Red-Black trees  B-Trees (used for searching secondary memory)  nodes are added.

1 Balanced Search Trees  several varieties  AVL trees  trees  Red-Black trees  B-Trees (used for searching secondary memory)  nodes are added.
AVL trees. AVL Trees We have seen that all operations depend on the depth of the tree. We don’t want trees with nodes which have large height This can.

AVL trees. AVL Trees We have seen that all operations depend on the depth of the tree. We don’t want trees with nodes which have large height This can.
Chapter 4: Trees Binary Search Trees

Chapter 4: Trees Binary Search Trees
AVL Trees1 6 3 8 4 v z. 2 AVL Tree Definition AVL trees are balanced. An AVL Tree is a binary search tree such that for every internal node v of T, the.

AVL Trees v z. 2 AVL Tree Definition AVL trees are balanced. An AVL Tree is a binary search tree such that for every internal node v of T, the.
1 Joe Meehean.  BST efficiency relies on height lookup, insert, delete: O(height) a balanced tree has the smallest height  We can balance an unbalanced.

1 Joe Meehean.  BST efficiency relies on height lookup, insert, delete: O(height) a balanced tree has the smallest height  We can balance an unbalanced.
Red Black Tree Smt Genap 2011-2012. Outline Red-Black Trees ◦ Motivation ◦ Definition ◦ Operation Smt Genap 2011-2012.

Red Black Tree Smt Genap Outline Red-Black Trees ◦ Motivation ◦ Definition ◦ Operation Smt Genap
1 Binary Trees Informal defn: each node has 0, 1, or 2 children Informal defn: each node has 0, 1, or 2 children Formal defn: a binary tree is a structure.

1 Binary Trees Informal defn: each node has 0, 1, or 2 children Informal defn: each node has 0, 1, or 2 children Formal defn: a binary tree is a structure.

Similar presentations

Ads by Google