Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / kalpana rana
An AVL tree is a binary tree in which the difference between
the height of the right and left subtrees (or the root node)
is never more than one.
| Is This Answer Correct ? | 11 Yes | 3 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
What is hashing technique?
Which sorting is best?
Why do we need searching algorithms?
What is difference between list and linked list?
Why null is allowed in hashmap?
What do you mean by selection sort?
What is a subtree?
What is the difference between sorting and classifying?
What do you mean by hash table?
Is quicksort greedy algorithm?
What is data and its type?
Define leaves?
What is an ordered list?
Why is quicksort better than mergesort?
How to initialize Dictionary using collection initialize?
