campus placement AMCAT Mock Test Programming and Data Structure Binary Heap Binary Search Tree

In a heap with n elements and having min-heap property, the runtime of inserting a new smallest element is

1
O(n)
2
O(1)
3
O(log n)
4
O(n logn)
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters