Interested to Buy Any Domain ? << Click Here >> for more details...
In an AVL tree, at what condition the balancing is to be done?
- 1 Answers
- 1547 Views
- I also Faced
- E-Mail Answers
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
Which sorting is stable?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
List the applications of stacks?
What is hashing with example?
Why is an array homogeneous?
How does a hashtable work?
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential
Why do we need a data structure?
What is the difference between Array and Arraylist?
How does a treemap work?
What is a map programming?
Why might quick sort might be better than merge sort?
What is data structure and its operations?
How many types of search algorithms are there?
Can nsarray contain nil?
