GATE | GATE-CS-2007 | Question 47

Consider the process of inserting an element into a Max Heap, where the 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) (logn) (B) (LogLogn ) (C) (n) (D) (nLogn) (A) A (B) B (C) C (D) D
Answer:(B)
Explanation: See Question 2 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-12/amp/
Quiz of this Question