Defines base class for heap element. The heap element stores an object in the heap element,
A heap is a complete binary tree where every node's value is guaranteed to be greater than its children's values. This class manages a node in the binary tree. Descendant classes override this class to provide the sorting node value.
Namespace: DataStructures
Delphi
|
type
THeapElement = class(TPersistent)
end;
|
|
Name
|
Description
|
|
Index
|
Specifies the position of the heap element in the heap.
|
|
Item
|
Specifies an object associated with the heap element. This is the object to store in the heap, not the value that defines the heap order.
|
Top
|
|
Name
|
Description
|
|
Assign(TPersistent)
|
Represents method Assign(TPersistent).
|
|
Clear
|
Clear or resets the heap element.
|
|
Clone
|
Creates a copy of the heap element.
 Note
|
It is the responsibility of the calling method to free the copy.
|
|
Top
|
