+1 vote
in Data Structures & Algorithms I by (110k points)
To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?

(a) true

(b) false

This question is from AVL Tree in division Binary Trees of Data Structures & Algorithms I

This question was addressed to me in homework.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct option is (a) true

Easy explanation - It is interesting to note that after insertion, only the path from that point to node or only that subtrees are imbalanced interms of height.

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

...