GOEDUHUB Online Courses || Last Batch Student's Projects || COVID-19 Projects(AI-ML) || Universities  ||  Placement Preparation  Subscribe our youtube channel
+91-7976731765 Free Online Tutorials || AI || ML || NLP ||  OpenCV || Python || DBMS || OOPs || DSA || Java || Linux/Unix ||  C Programming
0 like 0 dislike
32 views

1 Answer

1 like 0 dislike
by (124 points)

In Avl tree , generally there are two types of rotation.

1. Right Rotation 

2. Left Rotation 

Right Rotation: When balancing factor of node in a tree is more than +1 , we need to rotate tree in right direction. 

Algorithm: Right Rotation  [Rotation along node P]

Step 1. Begin 

Step 2. Set  q=p -> Left 

Step 3. Set hold = q -> Right 

Step 4. Set q -> right =p

Step 5. Set p -> Left = hold

Step 6. Return 

Left Rotation: When balancing factor  of a node is less than -1 , we need to rotate it in left direction. 

Algorithm: Left Rotation [Rotation along node P]

Step 1. Begin 

Step 2. Set 1 = p -> right 

Step 3. Set hold = q -> left 

Step 4. Set q -> left = p

Step 5. Set p -> right =hold 

Step 6. Return 

Related questions

 Goeduhub:

About Us | Contact Us  © goeduhub.com Social::   |  | 
 Placements:   List of companies | Logical Reasoning Questions | Quantitative Aptitude Questions | General English Questions | Technical-MCQ and Interview Questions
 Important Lists: List of NITsList of IITsList of Exams After Graduation | List of Engineering Entrance Examinations (UG/PG)College ReviewsCollege Fest, Events & WorkshopsKnowledge ShareTrainees/Interns After 15-04-2020
Exams & Cutoffs: JEE Main | JEE Advanced | GATE | IES | ISROList of PSUs || Cutoff-GATECutoff_IIT-JEECS-ScopeECE ScopeEE-Scope
 Download Previous Year Papers For:  GATE | IES | RAJASTHAN TECHNICAL UNIVERSITY (RTU-Kota)RPSC Technical Exams | ISRO
...