GATE 2011
We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?
Related Programming & Data Structures PYQs
Consider it to rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the nu…
Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree repre…
What does the following fragment of C-program print? ```c char c[] = "GATE2011"; char *p = c; printf("%s", p + p[3] - p[1]); ```
A max-heap is a heap where the value of each parent is greater than or equal to the values of its children. Which of the following…
Let n be an odd number greater than 100. Consider a binary minheap with n elements stored in an array P whose index starts from 1.…
Consider a hash table P[0, 1, ..., 10] that is initially empty. The hash table is maintained using open addressing with linear pro…
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.