| http://www.w3.org/ns/prov#value | - A (binary) max heap is a data structure which can be visualized as a complete binary tree, which is a binary tree in which every level is completely filled except for possibly the last level which is filled from left to right as much as possible.
|
