Defines the order of nodes in a complete binary tree heap.
A heap is a complete binary tree where every node's value is guaranteed to be greater (or lesser depending on this type) than its children's values.
Namespace: DataStructures
Delphi |
type |
|
Reference |
