How can we define a AVL tree?

A. A tree which is binary search tree and height balanced tree.

B. A tree which is a binary search tree but unbalanced tree.

C. A tree with utmost two children

D. A tree with utmost three children

Correct Answer is :

A. A tree which is binary search tree and height balanced tree.

Explanation

An AVL tree is a binary search tree and height balanced tree.