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

# TAVLTree.FindNearestKey

Find nearest key for a data pointer

## Declaration

Source position: avl_tree.pp line 141

`public function TAVLTree.FindNearestKey(`
`Key: Pointer;`
`const OnCompareKeyWithData: TListSortCompare`
`):TAVLTreeNode;`

## Arguments

`Key` |  | Key to search with
`OnCompareKeyWithData` |  | Compare function

## Function result

The nearest possible key, if any

## Description

FindNearestKey attempts to find the nearest possible key in the tree using the OnCompareKeyWithData function. It returns the closest possible key in the tree.

## Errors

None.

## See also

TAVLTree.FindKey |  | Find a data item in the tree using alternate compare mechanism

Documentation generated on: May 14 2021