engineering recuitment GATE CSE 2023-24 Test Series Algorithms Searching, Sorting and Hashing Sorting
Which of the below statements is/are FALSE?
1
The height of any binary search tree with n nodes is 0(logn)
2
In a max-heap, kth largest element will always be on kth level.
3
Inserting into an AVL tree with n nodes requires θ(log n) rotations.
4
In a min-heap, largest element will always be at the last level.