| [Overview][Classes][Index] |
Find the node most right to a specified node
Source position: avl_tree.pp line 72
public function TAVLTree.FindRightMost( |
Data: Pointer |
):TAVLTreeNode; |
Data |
|
The data item where to start the search from |
The rightmost node relative to Data
FindRightMost finds the node most right from the Data node. It starts at the succeding node for Data and tries to move as far left in the tree as possible.
This operation corresponds to finding the next item in a list.
|
Find the node most left to a specified data node |
|
|
Find the node most left to a specified key node |
|
|
Find the node most right to a specified key node |
| lazarus-ccr.sourceforge.net |