Binary search tree whose left sub-tree and right sub-tree differ in height by at most 1 unit is called? (A) Lemma tree (B) Red Black tree (C) AVL tree (D) None of the aboveâ–ºCorrect Option Correct Answer is: C