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
Which sorting technique is best?
How memory is reserved using a declaration statement ?
Define in brief an array. What are the types of array operations?
Which programming language is best for data structures?
What is the difference between linked list and array?
Can tuple be sorted?
Explain the Array
Which is faster array or arraylist?
How to initialize Dictionary using collection initialize?
How to find if linked list has loop?
What is hashing with example?
Write any two principles of gradation of structures.
What is the purpose of sorting algorithms?
How to create an Array?
What is collections singletonlist?
