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 |
Is hashmap faster than arraylist?
How many types of linked list are there?
What is difference between list and array list?
What package is arraylist?
Explain binary representation?
What is sorting explain?
What is heap and its types?
How do you implement a stack?
What is different between array and list?
Explain the Array
Is unordered_map a hash table?
What is a threaded binary tree? Explain its operation with example?