GATEverse Practice, past papers & mock tests
GATE 2007
Programming & Data StructuresTreesmediumMCQ2 marks
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:
Save your progress

Related Programming & Data Structures PYQs