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
What is data structure and why it is important?
What is data structure definition?
Name few classes that implement collection interface?
Is radix sort stable?
What is meant by heap sort?
Define a linear and non linear data structure.
What do you mean by free pool?
Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?
What are the classification of data structures?
Is quicksort recursive?
What is adt example?
What is a treeset?
What is mean by abstract data type?
Is merge sort better than quick?
What is arraylist load factor?
