KdMeanSelectionPrecedence

References
Enumerates the possible ways in which leaves can be enumerated.

Enum values

NameValueDescription
Recursive0Recursive enumeration is implied by the data structure and is also the quickest.
Small1Small leaf nodes are returned first.
Large2Large leaf nodes are returned first.
Empty3Nodes containing few items are returned first.
Full4Nodes containing many items are returned first.