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 the minimum number of nodes that a binary tree can have?
Which collection allows null values?
Why is sorting necessary?
Differentiate linear from non linear data structure?
Explain what are the major data structures used in the hierarchical data model?
What is data structure and its classification?
What is data structure geeksforgeeks?
What are data structures in programming?
Which is faster arraylist or linked list?
do records fall under linear or non linear data structures?
What are the different types of data structures?
Explain the most efficient method to reverse a linked list?
What is different between array and list?
Explain what is B-tree?
What does the dummy header in linked list contain?
