Interested to Buy Any Domain ? << Click Here >> for more details...
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
Differentiate between hashmap and hashtable.
What is internal and external sorting?
What are the disadvantages of linked list?
what are the applications of Linked Lists?
Which is more efficient merge sort vs quicksort?
What is a Stack? Explain with example?
In what data structures are pointers applied?
What is difference between hashmap and map?
Can a class have a constructor?
For searches. Which one is most preferred: array list or linked list?
What is meant by int?
Define a priority queue?
Explain the applications of stack?
Can we insert null in list?
What is ascii sort order?
