Attribution Non-Commercial (BY-NC)

6 views

Attribution Non-Commercial (BY-NC)

- Data Structures
- DecisionTree.xls
- cm_editor_help.pdf
- Amazon questions.docx
- 5. Randomized Algorithms for Optimizing Large Join Queries - Ioannidis
- Optimizing Decision Tree Pipelines for Distributed Environments
- Binary Search Tree
- 720 BPP en US Plan Procurement
- clusteranalysis
- Decisision Trees (2)
- DecisionTree(Final) (1)
- DSA Some Useful Statements
- clock mesh optimization
- binarytree.txt
- Epi Light Java
- Www Geeksforgeeks Org
- Submission
- J48
- btrees2.pdf
- 07a3ec15 Advanced Data Structures

You are on page 1of 24

The disadvantage of a binary search tree is that its height can be as large as N-1 This means that the time needed to perform insertion and deletion and many other operations can be O(N) in the worst case We want a tree with small height A binary tree with N node has height at least (log N) Thus, our goal is to keep the height of a binary search tree O(log N) Such trees are called balanced binary search trees. Examples are AVL tree, red-black tree.

AVL tree

Height of a node The height of a leaf is 1. The height of a null pointer is zero. The height of an internal node is the maximum height of its children plus 1

Note that this definition of height is different from the one we defined previously (we defined the height of a leaf as zero previously).

AVL tree

An

for every node in the tree, the height of the left and right subtrees differ by at most 1.

AVL property violated here

AVL tree

Let x be the root of an AVL tree of height h Let Nh denote the minimum number of nodes in an AVL tree of height h Clearly, Ni Ni-1 by definition We have N N N 1

h h 1 h2

The boundary conditions are: N1=1 and N2 =2. This implies that h = O(log Nh). Thus, many operations (searching, insertion, deletion) on an AVL tree will take O(log N) time.

N h 2i N h 2

Rotations

When the tree structure changes (e.g., insertion or deletion), we need to transform the tree to restore the AVL tree property. This is done using single rotations or double rotations.

x y B A

Before Rotation

y x

After Rotation

Rotations

Since

an insertion/deletion involves adding/deleting a single node, this can only increase/decrease the height of some subtree by 1 Thus, if the AVL tree property is violated at a node x, it means that the heights of left(x) ad right(x) differ by exactly 2. Rotations will be applied to x to restore the AVL tree property.

Insertion

First, insert the new key as a new leaf just as in ordinary binary search tree Then trace the path from the new leaf towards the root. For each node x encountered, check if heights of left(x) and right(x) differ by at most 1. If yes, proceed to parent(x). If not, restructure by doing either a single rotation or a double rotation [next slide]. For insertion, once we perform a rotation at a node x, we wont need to perform any rotation at any ancestor of x.

Insertion

Let

x be the node at which left(x) and right(x) differ by more than 1 Assume that the height of x is h+3 There are 4 cases

of left(left(x)) is h+1 single rotate with left child Height of right(left(x)) is h+1 double rotate with left child

Height

of right(right(x)) is h+1 single rotate with right child Height of left(right(x)) is h+1 double rotate with right child

Height

Note: Our test conditions for the 4 cases are different from the code shown in the textbook. These conditions allow a uniform treatment between insertion and deletion.

Single rotation

The new key is inserted in the subtree A. The AVL-property is violated at x height of left(x) is h+2 height of right(x) is h.

Single rotation

The new key is inserted in the subtree C. The AVL-property is violated at x.

AVL Tree

5

5

x

8

8

4 0.8 1

y

4

A Insert 0.8 3 5

4 0.8 8

After rotation

Double rotation

The new key is inserted in the subtree B1 or B2. The AVL-property is violated at x. x-y-z forms a zig-zag shape

Double rotation

The new key is inserted in the subtree B1 or B2. The AVL-property is violated at x.

x

C

8

AVL Tree

3

y 8

4

3.5

Insert 3.5 4 5

3.5

8

After Rotation

An Extended Example

Insert 3,2,1,4,5,6,7, 16,15,14

3 3 Fig 1 2 Fig 2 2 1 Fig 3 1 Fig 5 4 1 Fig 6 2 2 1 Fig 4

Single rotation

3

2

Single rotation

3

4

2 1 3

Single rotation

1

4

5 Fig 7 4 2 3

4

5 Fig 8

4

6

Single rotation

5

3 Fig 9 2 1 3 5 6 4 1

2 3

5

6 Fig 10 7

6

7 Fig 11

4 2 1 3 5 Fig 12 4

6

7 16

Double rotation

2 1

4 2

6

3

5 Fig 13 15 7 16 1 3

6

5 15 16 Fig 14 7

4 2

Double rotation

4 2 7 3 6 15

6

3 5 15 16 7 Fig 15 14 1

5 Fig 16

14

16

Deletion

Delete a node x as in ordinary binary search tree. Note that the last node deleted is a leaf. Then trace the path from the new leaf towards the root. For each node x encountered, check if heights of left(x) and right(x) differ by at most 1. If yes, proceed to parent(x). If not, perform an appropriate rotation at x. There are 4 cases as in the case of insertion. For deletion, after we perform a rotation at x, we may have to perform a rotation at some ancestor of x. Thus, we must continue to trace the path until we reach the root.

Deletion

On

closer examination: the single rotations for deletion can be divided into 4 cases (instead of 2 cases)

Two cases for rotate with left child Two cases for rotate with right child

In both figures, a node is deleted in subtree C, causing the height to drop to h. The height of y is h+2. When the height of subtree A is h+1, the height of B can be h or h+1. Fortunately, the same single rotation can correct both cases.

In both figures, a node is deleted in subtree A, causing the height to drop to h. The height of y is h+2. When the height of subtree C is h+1, the height of B can be h or h+1. A single rotation can correct both cases.

Rotations in deletion

There

are 4 cases for single rotations, but we do not need to distinguish among them. There are exactly two cases for double rotations (as in the case of insertion) Therefore, we can reuse exactly the same procedure for insertion to determine which rotation to perform

- Data StructuresUploaded byReddy Ghfsj
- DecisionTree.xlsUploaded byKristi Rogers
- cm_editor_help.pdfUploaded byjormula
- Amazon questions.docxUploaded bysatyam
- 5. Randomized Algorithms for Optimizing Large Join Queries - IoannidisUploaded byPanos Koukios
- Optimizing Decision Tree Pipelines for Distributed EnvironmentsUploaded byNikhilBuduma
- Binary Search TreeUploaded byMagesh Sankar
- 720 BPP en US Plan ProcurementUploaded bymssarwar9
- clusteranalysisUploaded byramthe1
- Decisision Trees (2)Uploaded bymyra
- DecisionTree(Final) (1)Uploaded byPeeyush Agarwal
- DSA Some Useful StatementsUploaded bySanjeev Praja
- clock mesh optimizationUploaded byPrabhug Vg
- binarytree.txtUploaded byFahmi Rusdi Al Islami
- Epi Light JavaUploaded byarungov
- Www Geeksforgeeks OrgUploaded bymebin
- SubmissionUploaded byCarlangaslangas
- J48Uploaded byTaironneMatos
- btrees2.pdfUploaded byBhavin Panchal
- 07a3ec15 Advanced Data StructuresUploaded byandhracolleges
- Augmented DS.prnUploaded bychidda11
- How to Guide Cross SP Search Based on Property UnificationUploaded byJORGE
- seteoUploaded byMarcoVillaranReyes
- Priority QueuesUploaded byspmece
- Publishing ElementsUploaded bymolly-1
- Data Structure in cUploaded byad_prakash2010
- dandc2.pdfUploaded byKevin Lei
- TINalgUploaded byAleksandra Cvetković Nedeljković
- sddsUploaded byAnonymous BOreSF
- b.c.a ( Science ) 2016 PatternUploaded byHRishikesh Rohokale

- An Efficient RDL Routing for Flip Chip DesignsUploaded byAparna Tiwari
- LAYERS and LEVELS - What a Column of Water Tells Us About Human CognitionUploaded bywiesio1
- The Neurohistological TechniquesUploaded byapi-3846255
- Alexandre DumasUploaded byGeorgian National Museum
- Journal Reading Coffee With CirrhosisUploaded byVito Masagus
- 復活節和耶穌 - Easter and JesusUploaded byFree Children's Stories
- HP CNAUploaded bysantoshkodihalli
- Careers in Venture CapitalUploaded byanton88be
- GLOBOCAN 2012 copia 2.pdfUploaded byFernando Cruz
- 8 Essential Strategies for Academic SuccessUploaded byJade Bedard
- Chapter 13Uploaded byjeff
- Irony BooklistUploaded byAhmed S. Mubarak
- Forouzan Sol 19Uploaded byAnurag Upadhyay
- careers-guide-18.pdfUploaded byZareena Carrim
- The Violin - George HartUploaded byAlban Leka
- Appendix 2 - Uniform Code of Military JusticeUploaded bymai100
- Colonel James Irwin: Creationist AstronautUploaded byeustoque2668
- Categories of AusterityUploaded byHoracio Tackanoo
- Equal to AllUploaded byMois Navon
- Job Duties of an Altar ServerUploaded byAngie Lawrence
- Logistic KavinUploaded byMeena Sivasubramanian
- osteoartroseUploaded byalfacegostoso7097
- Coefficients Supersonic FlowsUploaded bya320neo
- Vadiraja a Proposal PPTUploaded byVadiraja Acharya
- cpacity plannning2Uploaded bymalikzai777
- unit planUploaded byapi-249250073
- CHM12-3LU1Uploaded byAven Mhar
- Consignment CorrectUploaded byPraveetha Prakash
- Mathematics Yr 10Uploaded byHon Monda Bw'Onchwati
- Miliband - Marxism and PoliticsUploaded bymikeh