Q47

MCQ2 marks, −0.5

Consider the process of inserting an element into a $\text{Max Heap}$ , where the $\text{Max Heap}$ is represented by an array. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of comparisons performed is:

(A)

$\Theta(\log_2n)$

(B)

$\Theta(\log_2\log_2n)$

(C)

$\Theta(n)$

(D)

$\Theta(n\log_2n)$

Loading…