What maximum difference in heights between the leafs of a AVL tree is possible?
(a) log(n) where n is the number of nodes
(b) n where n is the number of nodes
(c) 0 or 1
(d) atmost 1
My doubt is from AVL Tree in section Binary Trees of Data Structures & Algorithms I
This question was posed to me in an interview.