QUESTION $3$

Conect Answer$-2$ Marks

Which of the following opion is correct?

Inserting into an AVL tree with n nodes requires @$($logn$)$ rototions.

The depths of ony two leaves in a max heap differ by at most $1.$

The height of any binary search tree with $n$ nodes is O$($logn$).$

All of the above