Hosted by Dailymotion. For legal issues report at the Copyright Center, report us on DMC, or use the Instant Removal tool.
CS301 Lecture No. 21
222 Views • Mar 30, 2014
Description
Cases of Rotation
The single rotation does not seem to restore the balance. We will re-visit the tree and
rotations to identify the problem area. We will call the node that is to be rotated as α
(node requires to be re-balanced). Since any node has at the most two children, and a
height imbalance requires that α’s two sub-trees differ by two (or –2), the violation
will occur in four cases:
1. An insertion into left subtree of the left child of α.
2. An insertion into right subtree of the left child of α.
3. An insertion into left subtree of the right child of α.
4. An insertion into right subtree of the right child of α.
More from User
After Banning of his Film “Phantom” in Pakistan Saif Ali Khan Reaction
Cyberian Star
How to Install and Crack IDM
Cyberian Star
How to install and use Teamviewer
Cyberian Star
Go Nawaz Go Challenge Sweet Gril
Cyberian Star
Bisti Jai nai hogai, Funny Video
Cyberian Star
Bechaara Husband... Funyy Video
Cyberian Star
Related Videos
AVL Tree Rotation Types Explained for Self-Balancing Binary Search Trees
Neural Lantern
AVL Tree Rotations Tutorial: Fixing Imbalance After Adding a Node
Neural Lantern
Tree Data Structure: Introduction, Decision Tree, and Traversal Algorithm
takdirstis
Lecture 1: Introduction to Data Structures and Algorithms - Richard Buckland
Sulema Betancourt
Download The Design of Dynamic Data Structures (Lecture Notes in Computer Science) PDF Free
Hilda Malk
Download Efficient Structures for Geometric Data Management (Lecture Notes in Computer Science)
Vinata Saini