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?

Category: QuestionsTo 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?
Editor">Editor Staff asked 1 month ago

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 Answers
Editor">Editor Staff answered 1 month ago

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.