| [Overview][Classes][Index] |
Find the node most right to a specified key node
Source position: avl_tree.pp line 75
public function TAVLTree.FindRightMostKey( |
Key: Pointer; |
OnCompareKeyWithData: TListSortCompare |
):TAVLTreeNode; |
Key |
|
Key identifiying the node where to start the search. |
OnCompareKeyWithData |
|
Callback to compare key value with data item |
The rightmost node for Key
FindRightMostKey finds the node most left from the node associated with Key. It starts at the succeding node for Key and tries to move as far right in the tree as possible.
|
Find the node most left to a specified data node |
|
|
Find the node most right to a specified node |
|
|
Find the node most left to a specified key node |
| lazarus-ccr.sourceforge.net |