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

• A. At least one
• B. At most one
• C. Two
• D. At most two