Q28

MCQ2 marks, −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?

(A)

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

(B)

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

(C)

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

(D)

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

Loading…