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
How do you sort an arraylist in descending order?
how to delete first node from singly linked list?
What is dangling pointer and how to avoid it?
How many passes does bubble sort need?
Define heap order property?
How many sorting algorithms are there?
Define a linear and non linear data structure.
List the differences between comparable and comparator interface?
What are the goals of data structure?
Why do we need linked list?
What are the different binary tree traversal techniques?
Where is insertion sort used?
Can a null element added to a treeset or hashset?
Can we put null value in hashmap?
What is integer max_value?
