# findNodesInRange

suspend fun < T > SortedBinaryTreeNode < T >. findNodesInRange (from: T , to: T , fromInclusiveMode: Boolean , toInclusiveMode: Boolean ): Set < SortedBinaryTreeNode < T >>(source)
suspend fun < T > SortedBinaryTreeNode < T >. findNodesInRange (from: T , to: T ): Set < SortedBinaryTreeNode < T >>(source)
suspend fun < T : Comparable < T >> SortedBinaryTreeNode < T >. findNodesInRange (range: ClosedRange < T >): Set < SortedBinaryTreeNode < T >>(source)