medium10 pts · first answer countsstacks-and-queues

Finding an arbitrary value in a heap

How long does it take to check whether a specific value, not the minimum, exists in a binary min-heap?

A.O(log n), follow the path like a search treeB.O(n), the heap gives no order between siblingsC.O(1), use the heap index formulaD.O(log^2 n), search each level

Discussion 0

Join free to post in the discussion.

Finding an arbitrary value in a heap

Discussion 0

Related questions