In an AVL tree, at what condition the balancing is to be done?
Answer / 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 |
Which sorting algorithm is best for small data?
Are sets sorted?
What is difference between static and dynamic array?
Does hashmap maintain insertion order?
Differentiate between hashset and hashmap.
Define ancestor and descendant ?
What is sequential search? What is the average number of comparisons in a sequential search?
What is sorting an array?
Why is data structure important?
Define open addressing?
What is the minimum number of queues needed when implementing a priority queue?
Describe stack operation.