Computer scienceAlgorithms and data structuresData structuresGraphsGraph types

Binary heap

Statements

Report a typo

Choose a correct statement:

Select one option from the list

The second smallest/largest element is always on the second level of the min/max-heap.

A binary heap cannot contain two identical elements.

Binary heap may contain loops like a regular graph.

Binary heap is not a tree.

Create a free account to access the full topic