[Overview][Classes][Index] Reference for unit 'AVL_Tree' (#fcl)

TAVLTree.FindRightMost

Find the node most right to a specified node

Declaration

Source position: avl_tree.pp line 88

public function TAVLTree.FindRightMost(

  Data: Pointer

):TAVLTreeNode;

Arguments

Data

  

The data item where to start the search from

Function result

The rightmost node relative to Data

Description

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.

See also

TAVLTree.FindLeftMost

  

Find the node most left to a specified data node

TAVLTree.FindLeftMostKey

  

Find the node most left to a specified key node

TAVLTree.FindRightMostKey

  

Find the node most right to a specified key node


Documentation generated on: Nov 14 2015