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
What is entryset in hashmap?
Is bucket sort a comparison sort?
How can I learn data structures?
What is a Queue? Explain its operation with example?
What is the minimum number of nodes in an avl tree of height h?
What is an externalizable interface?
What is data type explain?
What is data structure explain in detail?
Run time memory allocation is known as in data structure?
State the different ways of representing expressions?
Explain the sorting algorithm that is most suitable to be used with single linked list?
How do I sort hashset?
What is linked list with example?
Name the areas in which you can apply data structures extensively?
Two linked lists are given, find out the sum of them without altering the linked list?
