Method lower

data_structures/unstable_binary_search_tree.ts:379–381

* Finds the highest (rightmost) value in the binary search tree which is * strictly less than the given value, or null if the given value * is lower than or equal to all elements of the tree * * The complexity of this operation depends on the underlying structure of the * tree. Refer

(value: T)

   * @returns The lower value if it was found, or null if not.
   */
  lower(value: T): T | null {
    return this.#findNode(value, "lower", false)?.value ?? null;
  }
}