GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2011
Programming & Data StructuresTreeseasyMCQ1 mark
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 binary trees is a max-heap? (a) Complete tree with root 10, left child 8 (children 4, 5 with 5 having child 1), right child 6 (child 2) (b) Complete binary tree with root 10; left child 8 (children 4, 5); right child 6 (children 1, 2) (c) Complete binary tree with root 10; left child 5 (children 4, 8); right child 6 (children 2, 1) (d) Tree with root 5; left child 2 (children 1, 4); right child 8 (children 6, 10)
Save your progress

Related Programming & Data Structures PYQs

GATE 2011

Consider it to rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the nu…

GATE 2011

Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree repre…

GATE 2011

What does the following fragment of C-program print? ```c char c[] = "GATE2011"; char *p = c; printf("%s", p + p[3] - p[1]); ```

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 wit…

GATE 2026 · CS1 - Forenoon

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.…

GATE 2026 · CS1 - Forenoon

Consider a hash table P[0, 1, ..., 10] that is initially empty. The hash table is maintained using open addressing with linear pro…