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 |
How does selection sort work?
When is a binary search best applied?
Can a tree be empty?
What are the basic data structures?
What method removes the value from the top of a stack?
State the difference between queues and linked lists?
How to create an Array?
Differentiate stack from array?
Explain the priority queue?
Does treeset allow null values?
Differentiate between hashset and hashmap.
Which is faster arraylist or hashmap?