Which of the following option is correct?

Inserting into an AVL tree with n nodes requires (logn) rotations.

The depths of any 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