GATE 2020
Consider the array representation of a binary min-heap containing 1023 elements. The minimum number of comparisons required to find the maximum in the heap is _______
Related Programming & Data Structures PYQs
The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the following is the postorder trav…
What is the worst case time complexity of inserting n^2 elements into an AVL-tree with n elements initially?
What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintaine…
Consider the following C program: ```c #include <stdio.h> int main() { int a[4][5] = { {1, 2, 3, 4, 5}, {6, 7…
Consider a double hashing scheme in which the primary hash function is h1(k) = k mod 23, and the secondary hash function is h2(k) …
In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a, b]…
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.