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
In Data Structure, write output of given program.
Tell me about circular linked list?
How is a queue works?
What is binary tree? Explain its uses.
Name some applications which use linked lists.
What is data structure what is need of it?
What is difference between capacity and size of arraylist?
Does hashset maintain order?
Explain in brief a linked list.
Is a hashmap a dictionary?
What are the properties of binary tree?
what is the biggest advantage of linked lists?
What is linear-logarithm chasm?
Complete structure of hashmap, very detail description, along with the basic coding of the hashmap internal implementation.
Given an unsorted linked list, and without using a temporary buffer, write a method that will delete any duplicates from the linked list?
