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 |
Difference between arrays and linked list?
How to get top two numbers from an array?
What is height balanced tree?
What are binary search and fibonacci search?
Which sorting algorithm is the slowest?
What is a linear search?
What is Insertion sort, selection sort, bubble sort( basic differences among the functionality of the three sorts and not the exact algorithms)?
What data structure underlies a python list?
Why sorting algorithms are important?
Explain the term run-time stack?
How does a selection sort work for an array?
You want to insert a new item in a binary search tree. How would you do it?