TIndexedAVLTree class
TAvgLvlTree - an Average Level binary Tree.Declaration
TIndexedAVLTree = class(TAvgLvlTree)Inheritance
- TIndexedAVLTree
- TAvgLvlTree
- TAvlTree
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))
This description is the one of AvgLvlTree.TAvgLvlTree.
Properties
Items | public |
Methods
DeletingNode | protected | |
Init | protected | |
NodeAdded | protected | |
RotateLeft | protected | |
RotateRight | protected | |
SwitchPositionWithSuccessor | protected | |
GetNodeAtIndex | public | |
NodeToIndex | public | |
IndexOf | public | |
ConsistencyCheck | public | Check the consistency of the tree. |
NodeToReportStr | public | Create a textual dump of the tree. |
Fields
fLastIndex | protected | |
fLastNode | protected |
Inherited
From TAvgLvlTree (5)
CreateObjectCompare DisposeNode FreeAndDelete OnObjectCompare OwnsObjects
From TAvlTree (47)
Add AddAscendingSequence Assign BalanceAfterDelete BalanceAfterInsert Clear Compare Count Create Delete Destroy Equals Find FindHighest FindInsertPos FindKey FindLeftMost FindLeftMostKey FindLeftMostSameKey FindLowest FindNearest FindNearestKey FindPointer FindPrecessor FindRightMost FindRightMostKey FindRightMostSameKey FindSuccessor FreeAndClear GetEnumerator GetEnumeratorHighToLow IsEqual MoveDataLeftMost MoveDataRightMost NewNode NodeClass OnCompare Remove RemovePointer ReportAsString Root SetCompares SetNodeClass SetNodeManager SetOnCompare SetOnObjectCompare WriteReportToStream
An experiment, built from development snapshots. Not the official Free Pascal or Lazarus documentation.