Method higher

data_structures/unstable_binary_search_tree.ts:352–354

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

(value: T)

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

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