Heaps

A min heap is a complete binary tree with a value V(N) at each node from a totally ordered set (such as integers or strings), such that if C is a child of N then V(N) ? V(C).

(2, Sue)

(5, Joe)

(9, Amy)

(9, Sam)

Previous slide

Next slide

Back to first slide

View graphic version