@datastructures-js/binary-search-tree-v4.1.0
[4.1.0] - 2021-04-21
Added
.lowerBound(k)
to find the node with biggest key less or equal a value k..upperBound(k)
to find the node with smallest key bigger than a value k.
.lowerBound(k)
to find the node with biggest key less or equal a value k..upperBound(k)
to find the node with smallest key bigger than a value k.