| [Overview][Classes][Index] |
Source position: avl_tree.pp line 66
public function TAVLTree.FindPrecessor( |
ANode: TAVLTreeNode |
):TAVLTreeNode; |
ANode |
|
The node from which to start the search |
The preceding node
FindPrecessor returns the successor to ANode: this is the rightmost node in the left subtree, or the rightmost node above the node ANode. This can of course be Nil.
This method is used when a node must be inserted at the leftmost position.
|
Find successor to node |
|
|
Move data to the nearest left element |
| lazarus-ccr.sourceforge.net |