Answer Posted / narendra sharma
Avl tree is self binary tree in which balancing factor lie
between the -1 to 1.It is also known as self balancing tree.
so BF=h(T(left sub tree))-h(T(right sub tree));
| Is This Answer Correct ? | 57 Yes | 2 No |
Post New Answer View All Answers
Explain the expression trees?
Where will be the free node available while inserting a new node in a linked list?
Define internal nodes?
How does the bubble sort work?
What is time complexity of bubble sort?
Why do we study data structures?
What is the difference between array and list?
Can an arraylist be null?
How to excel in data structures and algorithms?
Is array part of collection framework?
Which is the parent class of linkedhashset class?
Is data structures and algorithms important?
What is the space complexity of selection sort?
Which sorting algorithm is best for small data?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
