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.