[Overview][Types][Classes][Variables][Index] |
Find the node most left to a specified data node
Source position: avl_tree.pp line 150
public function TAVLTree.FindLeftMost( |
Data: Pointer |
):TAVLTreeNode; |
Data |
|
The data item where to start the search from |
The leftmost node relative to Data
FindLeftMost finds the node most left from the Data node. It starts at the preceding node for Data and tries to move as far right in the tree as possible.
This operation corresponds to finding the previous item in a list.
|
Find the node most right to a specified node |
|
|
Find the node most left to a specified key node |
|
|
Find the node most right to a specified key node |