How do you rotate an AVL tree?
- 1 Answers
- 1035 Views
- Global Logic, I also Faced
- E-Mail Answers
Answer / Govind Singh Bonal
An AVL tree rotates to maintain its balance after insertion or deletion of a node. There are four basic rotation types: Left Rotation, Right Rotation, Double Rotation (Left-Right), and Double Rotation (Right-Left). The specific type of rotation performed depends on the case and the properties violated by the operation.
| Is This Answer Correct ? | 0 Yes | 0 No |
Differentiate between hashset and treeset.
Is set sorted?
What is array in data structure with example?
What do you mean by open addressing?
Which algorithm is used in arrays sort?
What is a 2 dimensional array?
What is the difference between a push and a pop?
Write program for Quick sort ?
How to excel in data structures and algorithms?
What is a node in it?
Where the data structures are used?
Can you provide some implementation of a dictionary having large number of words?
Windows 
