Method min

data_structures/binary_search_tree.ts:510–512

* Retrieve the lowest (left most) value in the binary search tree, or null if * the tree is empty. * * 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 the m

()

   * @returns The minimum value in the binary search tree, or null if the tree is empty.
   */
  min(): T | null {
    return this.#root ? this.#root.findMinNode().value : null;
  }

  /**
   * Retrieve the highest (right most) value in the binary search tree, or null