+1 vote
in Data Structures & Algorithms I by (110k points)
What is an AVL tree?

(a) a tree which is balanced and is a height balanced tree

(b) a tree which is unbalanced and is a height balanced tree

(c) a tree with three children

(d) a tree with atmost 3 children

My question is based upon AVL Tree in chapter Binary Trees of Data Structures & Algorithms I

This question was posed to me in exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right choice is (a) a tree which is balanced and is a height balanced tree

Explanation: It is a self balancing tree with height difference atmost 1.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...