| Class TBinSearchTree (unit EZDSLBtr) |
| Constructors |
constructor Clone(Source : TAbstractContainer;
DataOwner : boolean; NewCompare : TCompareFunc);
constructor Create(DataOwner : boolean);| Functions |
function Delete(Cursor : TTreeCursor) : TTreeCursor;
procedure Insert(var Cursor : TTreeCursor; aData : pointer);
procedure Join(Cursor : TTreeCursor; Tree : TBinTree);
function Replace(Cursor : TTreeCursor; aData : pointer) : pointer;
function Search(var Cursor : TTreeCursor; aData : pointer) : boolean;
procedure acSort;
procedure bsSortTraverse(aNode : PNode);
procedure bsSwapData(OldCursor, NewCursor : TTreeCursor);| Properties |
| Events |
| Variables |
| Constructors |
constructor Clone(Source : TAbstractContainer;
DataOwner : boolean; NewCompare : TCompareFunc);--------
constructor Create(DataOwner : boolean);===TBinSearchTree==================================================== A binary search tree A sorted binary tree where for any given data object, all data objects in its left subtree are less than it, and all data objects in the right subtree are greater than it. This ordering relies on the Compare method to be overridden. =====================================================================
| Functions |
function Delete(Cursor : TTreeCursor) : TTreeCursor;--------
procedure Insert(var Cursor : TTreeCursor; aData : pointer);--------
procedure Join(Cursor : TTreeCursor; Tree : TBinTree);--------
function Replace(Cursor : TTreeCursor; aData : pointer) : pointer;--------
function Search(var Cursor : TTreeCursor; aData : pointer) : boolean;--------
procedure acSort;--------
procedure bsSortTraverse(aNode : PNode);--------
procedure bsSwapData(OldCursor, NewCursor : TTreeCursor);--------
| Properties |
| Events |
| Variables |