Method floor

data_structures/unstable_binary_search_tree.ts:325–327

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

(value: T)

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

  /**
   * Finds the lowest (leftmost) value in the binary search tree which is