GATE 2020
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 traversal of the tree?
Related Programming & Data Structures PYQs
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]…
Consider the following C functions: ```c int fun1(int n) { static int i = 0; if (n > 0) { ++i; fun1(n - 1…
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.