GATE 2017 · CS2 - Afternoon
The pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post-order traversal of this tree is:
Related Programming & Data Structures PYQs
Match the following. | List I | List II | | --- | --- | | (P) static char var; | (i) Sequence of memory locations to store addres…
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing…
Consider the following function implemented in C: ```c void printxy(int x, int y) { int *ptr; x = 0; ptr = &x; y …
Consider the C program fragment below: ```c while (r >= y) { r = r - y; q = q + 1; } ``` Which of the following conditions…
Consider the following snippet of a C program. Assume swap(&x, &y) exchanges contents of x and y. ```c int main() { int array…
Consider the following C Program: ```c #include <stdio.h> int main() { int m = 10; int n, n1; n = ++m; n1 = m++; …
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.