In an AVL tree, at what condition the balancing is to be done?
Answer Posted / ajay vikram
If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than –1.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is heap with example?
Why is hashing used?
Explain about map and their types?
What are the types of bulleted list?
Is collection a class or interface?
Define non-linear data structures?
Does concat mutate array?
How to compare Two Arrays?
Explain what is the data structures used to perform recursion?
Which is the parent class of sortedset
Which sorting algorithm has minimum number of swaps?
How do I use quick sort?
How long does it take to master data structures and algorithms?
How do you find the depth of a binary tree?
Differentiate null and void?