KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
Suppose we have a binary heap of n elements and wish to insert n more elements(not necessarily one after other). What would be the total time required for this? I think it's theta (n logn) as one insertion takes logn.
Tags (comma-separated)
Save Edits
Cancel