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 immutablelist?
What is the difference between Array and LinkedList?
What is the height of binary tree?
What do you mean by the term “percolate up”?
What are the basic data structures?
Explain the Stack
Which interfaces are implemented by concurrentskiplistset?
How to sequentially represent max-heap?
Write a program using mergesort technique.
How does a heap sort work?
Who invented quicksort?
Why would we use dynamically allocated arrays vs vectors?
What is shell sort in data structure?
Can you sort a hashmap?
What is pivot in quicksort?