A perfectly balanced binary search tree kept ordered by node key values

A linked list whose individual nodes are ranked by a priority weight value

A fully sorted array that always supports O(1) minimum value extraction

Complete binary tree that satisfies the heap property (parent >= children for max-heap)

Multiple ChoiceIntermediate 30s

Heap: Definition

A heap is a:

Options

1A perfectly balanced binary search tree kept ordered by node key values
2A linked list whose individual nodes are ranked by a priority weight value
3A fully sorted array that always supports O(1) minimum value extraction
4Complete binary tree that satisfies the heap property (parent >= children for max-heap)

Think you can answer under pressure?

Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.