Method find

data_structures/binary_search_tree.ts:487–489

* Check if a value exists in the binary search tree. * * The complexity of this operation depends on the underlying structure of the * tree. Refer to the documentation of the structure itself for more details. * * @example Finding values in the tree * ```ts * import { BinarySear

(value: T)

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

  /**
   * Retrieve the lowest (left most) value in the binary search tree, or null if