TAvgLvlTree class
TAvgLvlTree - an Average Level binary Tree.Declaration
TAvgLvlTree = class(TAvlTree)Inheritance
- TAvgLvlTree
- TAvlTree
Descends from it: TIndexedAVLTree
Description
TAvgLvlTree is an Average Level binary Tree. This binary tree is
always balanced, so that inserting, deleting and finding a node is performed
in O(log(#Nodes))
Properties
OwnsObjects | public |
Methods
CreateObjectCompare | public | Create an instance of the tree with extended compare method. |
DisposeNode | public | Dispose of a node outside of the tree. |
FreeAndDelete | public | Delete a node from the tree and destroy it. |
Events
OnObjectCompare | public | Same as OnCompare, but with a method instead of a procedure. |
Inherited
From TAvlTree (55)
Add AddAscendingSequence Assign BalanceAfterDelete BalanceAfterInsert Clear Compare ConsistencyCheck Count Create Delete DeletingNode Destroy Equals Find FindHighest FindInsertPos FindKey FindLeftMost FindLeftMostKey FindLeftMostSameKey FindLowest FindNearest FindNearestKey FindPointer FindPrecessor FindRightMost FindRightMostKey FindRightMostSameKey FindSuccessor FreeAndClear GetEnumerator GetEnumeratorHighToLow Init IsEqual MoveDataLeftMost MoveDataRightMost NewNode NodeAdded NodeClass NodeToReportStr OnCompare Remove RemovePointer ReportAsString Root RotateLeft RotateRight SetCompares SetNodeClass SetNodeManager SetOnCompare SetOnObjectCompare SwitchPositionWithSuccessor WriteReportToStream
An experiment, built from development snapshots. Not the official Free Pascal or Lazarus documentation.