Method ceiling

data_structures/unstable_binary_search_tree.ts:298–300

* Finds the lowest (leftmost) value in the binary search tree which is * greater than or equal to the given value, or null if the given value * is higher than all elements of the tree. * * The complexity of this operation depends on the underlying structure of the * tree. Refer to the

(value: T)

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

  /**
   * Finds the highest (rightmost) value in the binary search tree which is