GATE 2009
Consider the binary max-heap {25, 14, 16, 13, 10, 8, 12} implemented using an array. What is the content of the array after two delete operations on this heap?
Related Programming & Data Structures PYQs
What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.
Consider a binary max-heap implemented using an array. Which one of the following arrays represents a binary max-heap?
The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with ha…
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…
The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible h…
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.