Sign in Join
FPDoc Onlineexperiment

TAVLTree.FindRightMostKey function

Member of TAVLTreepublicIn unit AVL_Tree

Find the node most right to a specified key node.

Declaration

pascal
function FindRightMostKey(Key: Pointer; 
 const OnCompareKeyWithData: TListSortCompare)
: TAVLTreeNode

Arguments

Key

Key identifying the node where to start the search.

OnCompareKeyWithData

Callback to compare key value with data item.

Function result

The rightmost node for Key.

Description

FindRightMostKey finds the node most left from the node associated with Key. It starts at the succeeding node for Key and tries to move as far right in the tree as possible.

See also

An experiment, built from development snapshots. Not the official Free Pascal or Lazarus documentation.