Consider the following statements:
(i). The height of any binary search tree with n nodes is \(O(logn)\)
(ii). Inserting into an AVL tree with n nodes requires \(\theta (logn)\) rotations.
(iii). In a max-heap, kth largest element will always be on kth level.
Which of the above statements is/are FALSE?
1
(i) only
2
(i) and (ii) only
3
(iii) only
4
(i), (ii) and (iii)