Who among the following algorithm is used in external memory and compression of the suffix tree?

What is the primary property of an AVL tree?

A. It allows duplicate keys.

B. It is a self-balancing binary search tree.

C. It maintains a fixed height.

D. It allows duplicate keys.

Which of the following operations is used to restore balance in an AVL tree after insertion?

A. Merging

B. Splaying

C. Rotations

D. Hashing

In a Red-Black tree, which property ensures that no two consecutive red nodes exist on any path?

A. Black property

B. Balance property

C. Height property

D. Red property

What is the maximum height of an AVL tree with n nodes?

A. log₂(n + 1)

B. log₂(n)

C. 2*log₂(n)

D. log₁₀(n)