C-Programming-data-structure || 2021 SET 2 || MCQ || 2-mark || Module 2: Arrays | Stacks | Queue | Linked list

Last Updated :
Discuss
Comments

Let H be a binary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in H '? 2021 SET 2 || MCQ || 2-mark

Θ(n)

Θ(1)

Θ(logn)

Θ(n log n)

This question is part of this quiz :

GATE|| C Programming & Data Structure || Pyqs (2010 to 2025 ),GATE || Arrays | Stacks | Queue | Linked list || PYQS (2010 to 2025)
Tags:
C Programs
Data Structures
GATE CS
GATE CS
Share your thoughts in the comments
Article Tags :