An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by _________

(a) At least one

(b) At most one

(c) Two

(d) At most two

My question comes from Binary Trees in chapter Binary Trees of Data Structures & Algorithms I

The question was posed to me in a national level competition.