GATE CSE 2025 Set 2 | Trees Question 3 | Data Structures

GATE CSE 2025 Set 2

MCQ (Single Correct Answer)

-0.67

A meld operation on two instances of a data structure combines them into one single instance of the same data structure. Consider the following data structures:

P: Unsorted doubly linked list with pointers to the head node and tail node of the list.

Q: Min-heap implemented using an array.

R: Binary Search Tree.

Which ONE of the following options gives the worst-case time complexities for meld operation on instances of size $n$ of these data structures?

P: $\Theta(1), \mathrm{Q}: \Theta(n), \mathrm{R}: \Theta(n)$

$\mathrm{P}: \Theta(1), \mathrm{Q}: \Theta(n \log n), \mathrm{R}: \Theta(n)$

$\mathrm{P}: \Theta(n), \mathrm{Q}: \Theta(n \log n), \mathrm{R}: \Theta\left(n^2\right)$

$\mathrm{P}: \Theta(1), \mathrm{Q}: \Theta(n), \mathrm{R}: \Theta(n \log n)$

GATE CSE 2024 Set 2

MCQ (Single Correct Answer)

-0.66

You are given a set $V$ of distinct integers. A binary search tree $T$ is created by inserting all elements of $V$ one by one, starting with an empty tree. The tree $T$ follows the convention that, at each node, all values stored in the left subtree of the node are smaller than the value stored at the node. You are not aware of the sequence in which these values were inserted into $T$, and you do not have access to $T$.

Which one of the following statements is TRUE?

Inorder traversal of $T$ can be determined from $V$

Root node of $T$ can be determined from $V$

Preorder traversal of $T$ can be determined from $V$

Postorder traversal of $T$ can be determined from $V$

GATE CSE 2024 Set 1

MCQ (Single Correct Answer)

-0.66

Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of k is

GATE CSE 2023

MCQ (Single Correct Answer)

-0.67

Let A be a priority queue for maintaining a set of elements. Suppose A is implemented using a max-heap data structure. The operation EXTRACT-MAX(A) extracts and deletes the maximum element from A. The operation INSERT(A, key) inserts a new element key in A. The properties of a max-heap are preserved at the end of each of these operations.

When A contains n elements, which one of the following statements about the worst case running time of these two operations is TRUE?

Both EXTRACT-MAX(A) and INSERT(A, key) run in $$O(1)$$.

Both EXTRACT-MAX(A) and INSERT(A, key) run in $$O(\log(n))$$.

EXTRACT-MAX(A) runs in $$O(1)$$ whereas INSERT(A, key) runs in $$O(n)$$.

EXTRACT-MAX(A) runs in $$O(1)$$ whereas INSERT(A, key) runs in $$O(\log(n))$$.