Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lecture13: Tree III Bohyung Han CSE, POSTECH CSED233: Data Structures (2014F)

Published byKarina Biddix Modified over 9 years ago

Similar presentations

Presentation on theme: "Lecture13: Tree III Bohyung Han CSE, POSTECH CSED233: Data Structures (2014F)"— Presentation transcript:

1 Lecture13: Tree III Bohyung Han CSE, POSTECH bhhan@postech.ac.kr CSED233: Data Structures (2014F)

2 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Insertion Order matters Difference between these binary search trees?  Insert: 4, 2, 1, 3, 6, 5, 7  Insert: 1, 2, 3, 4, 5, 6, 7 2 4 2 31 6 75 1 5 3 2 4 7 6

3 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Complexity of Operations 3

4 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Self‐balancing Trees Variants of binary search tree Self‐balancing  Additional rules for how to structure tree  Needs operations to move nodes around Constraints on height differences of leaves Ensures that tree does not degenerate to list. 4

5 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 AVL Tree 5 44 17 32 48 78 8850 62 4 2 1 3 1 2 11 AVL tree

6 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Insertion Insertion is as in a binary search tree. 6 44 17 32 48 78 8850 62 4 2 1 3 1 2 11 Before insertion After insertion 44 17 32 48 78 8850 62 5 2 1 4 1 3 21 54 1

7 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Insertion 7 44 17 32 48 78 8850 62 5 2 1 4 1 3 21 54 1 b=x a=y c=z

8 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Restructuring Single Rotation: 8 h h-1 h-2 h-3 h-1 h-2 h-3 h-2

9 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Restructuring Double rotations: 9 h h-1 h-2 h-3 h-2 h-1 h-3 ≤h-3 h-2 ≤h-3

10 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Insertion Example 10 44 17 32 48 78 8850 62 5 2 1 4 1 3 21 54 1 b=x a=y c=z After insertion unbalanced After the first rotation 44 17 32 50 78 8862 54 5 2 1 4 1 3 1 2 48 1 a=y b=x c=z

11 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Insertion Example 11 44 17 32 48 62 88 50 54 4 2 1 3 2 2 11 78 1 c=z a=y b=x After the first rotation After the second rotation 44 17 32 50 78 8862 54 5 2 1 4 1 3 1 2 48 1 a=y b=x c=z

12 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Removal 12 44 17 32 48 62 88 50 54 4 2 1 3 2 2 11 78 1 Before deletion of 32 44 17 48 62 88 50 54 4 1 3 2 2 11 78 1 After deletion of 32

13 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Reconstructing after a Removal 13 44 17 48 62 88 50 54 4 1 3 2 2 11 78 1 z x y w

14 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 Reconstructing after a Removal Recursive reconstructing  Restructuring may upset the balance of another node higher in the tree.  We must continue checking for balance until the root is reached. 14 44 17 48 62 88 50 54 4 1 3 2 2 11 78 1 z w y w 62 44 48 78 50 54 4 3 2 1 2 11 88 1 y x z 17 x

15 CSED233: Data Structures by Prof. Bohyung Han, Fall 2014 AVL Tree Performance 15

16 16

Download ppt "Lecture13: Tree III Bohyung Han CSE, POSTECH CSED233: Data Structures (2014F)"

Similar presentations

© 2004 Goodrich, Tamassia AVL Trees1 6 3 8 4 v z.

© 2004 Goodrich, Tamassia AVL Trees v z.
AVL-Trees (Part 2: Double Rotations) Lecture 19 COMP171 Fall 2006.

AVL-Trees (Part 2: Double Rotations) Lecture 19 COMP171 Fall 2006.
AVL-Trees (Part 2) COMP171. AVL Trees / Slide 2 A warm-up exercise … * Create a BST from a sequence, n A, B, C, D, E, F, G, H * Create a AVL tree for.

AVL-Trees (Part 2) COMP171. AVL Trees / Slide 2 A warm-up exercise … * Create a BST from a sequence, n A, B, C, D, E, F, G, H * Create a AVL tree for.
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. 2 AVL Tree 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.

1 AVL Trees. 2 AVL Tree 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.
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.
1 AVL Trees (10.2) CSE 2011 Winter 2011 22 April 2015.

1 AVL Trees (10.2) CSE 2011 Winter April 2015.
AVL Tree Smt Genap 2011-2012. Outline AVL Tree ◦ Definition ◦ Properties ◦ Operations Smt Genap 2011-2012.

AVL Tree Smt Genap Outline AVL Tree ◦ Definition ◦ Properties ◦ Operations Smt Genap
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.
Lecture16: Heap Sort Bohyung Han CSE, POSTECH CSED233: Data Structures (2014F)

Lecture16: Heap Sort Bohyung Han CSE, POSTECH CSED233: Data Structures (2014F)
AVL Trees Balanced Trees. AVL Tree Property A Binary search tree is an AVL tree if : –the height of the left subtree and the height of the right subtree.

AVL Trees Balanced Trees. AVL Tree Property A Binary search tree is an AVL tree if : –the height of the left subtree and the height of the right subtree.
AVL Trees / Slide 1 Delete 12 9 5 3 8 11 12 12 5 3 1 2 8 11 9 Single rotation Deletion.

AVL Trees / Slide 1 Delete Single rotation Deletion.
Advanced Tree Data Structures Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.

Advanced Tree Data Structures Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
CSC311: Data Structures 1 Chapter 10: Search Trees Objectives: Binary Search Trees: Search, update, and implementation AVL Trees: Properties and maintenance.

CSC311: Data Structures 1 Chapter 10: Search Trees Objectives: Binary Search Trees: Search, update, and implementation AVL Trees: Properties and maintenance.
CSC 213 Lecture 7: Binary, AVL, and Splay Trees. Binary Search Trees (§ 9.1) Binary search tree (BST) is a binary tree storing key- value pairs (entries):

CSC 213 Lecture 7: Binary, AVL, and Splay Trees. Binary Search Trees (§ 9.1) Binary search tree (BST) is a binary tree storing key- value pairs (entries):
Department of Computer Eng. & IT Amirkabir University of Technology (Tehran Polytechnic) Data Structures Lecturer: Abbas Sarraf Search.

Department of Computer Eng. & IT Amirkabir University of Technology (Tehran Polytechnic) Data Structures Lecturer: Abbas Sarraf Search.
Binary Search Trees1 ADT for Map: Map stores elements (entries) so that they can be located quickly using keys. Each element (entry) is a key-value pair.

Binary Search Trees1 ADT for Map: Map stores elements (entries) so that they can be located quickly using keys. Each element (entry) is a key-value pair.
Self-Balancing Search Trees Chapter 11. Chapter 11: Self-Balancing Search Trees2 Chapter Objectives To understand the impact that balance has on the performance.

Self-Balancing Search Trees Chapter 11. Chapter 11: Self-Balancing Search Trees2 Chapter Objectives To understand the impact that balance has on the performance.

Similar presentations

Ads by Google