Computer scienceAlgorithms and Data StructuresData structuresGraphsGraph types

Binary heap

Statements

Report a typo

Choose the correct statements:

Select one or more options from the list

Min-heap always maintains the property that the parent node's value is smaller than or equal to the values of its children.

If you re-hang a binary heap to a different node, you will get a correct binary heap.

The depth of a binary heap is unambiguously determined by the number of elements in the heap.

It will take O(log n) time to check if there is an item in the binary heap.

___

Create a free account to access the full topic