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
Is hashset synchronized?
In depth questions regarding the data structures and the Databases used in the Projects developed.
Can we define the size of arraylist?
In rdbms, explain what is the efficient data structure used in the internal storage representation?
What is space complexity of a program?
Does treemap allow null values?
How to compare Two Arrays?
Is hashtable better than dictionary?
What data type is array?
What is a weighted graph?
What is difference between list and linked list?
What are the types of binary tree?
What is difference between list and set?
Does hashset allow duplicates?
What do you know about traversal in linked lists?