GATE 2021 · Set-1
A binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than the maximum element in T?
Related Programming & Data Structures PYQs
Consider the following sequence of operations on an empty stack. push(54); push(52); pop(); push(55); push(62); s = pop(); Conside…
Consider the following ANSI C program. ```c #include <stdio.h> int main() { int i, j, count; count = 0; i = 0; for (j = -3…
Consider the following ANSI C function: ```c int SimpleFunction(int Y[], int n, int x) { int total = Y[0], loopIndex; for (loo…
Let H be a binary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal …
Consider the following ANSI C program. ```c #include <stdio.h> int main(){ int arr[4][5]; int i, j; for (i=0; i<4; i++){ …
Consider a complete binary tree with 7 nodes. Let A denote the set of first 3 elements obtained by performing Breadth-First Search…
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.