Login and Register ×
Check your Email for the OTP
Data Structure Heap
⚠ Report ✓ Question Verified Copy Link
Explanation:
Answer: b) O(log n)
Explanation: The time complexity of inserting an element into a binary heap of n elements is O(log n).
Related Topic:
Share Above MCQ
Learn More MCQ Questions from Data Structure Heap