Heapsort: Heap Values

• Each vertex in a heap contains a value

• If a vertex has children, the value in the vertex must be larger than the value in either child.

• Example:

20

19

7

12

2

5

6

3

10

Previous slide

Next slide

Back to first slide

View graphic version