Which statement is true for a height$-$balanced tree with n nodes?

Group of answer choices

None of the other statements are correct.

Regarding the time complexity of a search, binary search trees are preferred to AVL trees

For all nodes, the right and left subtrees always have the same height

When rotating the top node in an AVL tree, the new top is always the leftmost node in the right subtree of the current top