Class BinarySearchTree<T>

constructor

• new BinarySearchTree<T>(): BinarySearchTree<T>

• Type Parameters

  • T

  Returns BinarySearchTree<T>

root

[iterator]

• [iterator](): Generator<T, any, any>

• Enables in-order traversal with the for...of syntax.

  Returns Generator<T, any, any>

  • An iterator for the tree values.

delete

• delete(value): boolean

• Deletes a value from the binary search tree, if it exists.

  Parameters

  • value: T

    The value to be deleted.

  Returns boolean

  • True if the value was deleted, otherwise false.

inOrderTraversal

• inOrderTraversal(): Generator<T, any, any>

• Generator function for in-order traversal of the tree. Yields each node's value in ascending sorted order.

  Returns Generator<T, any, any>

  • An iterator for the tree.

insert

• insert(value, allowDuplicates?): void

• Inserts a value into the binary search tree. By default, does not allow duplicate values.

  Parameters

  • value: T

    The value to be inserted.
  • OptionalallowDuplicates: boolean = false

    Flag to allow or disallow duplicate values.

  Returns void

search

• search(value): boolean

• Searches for a value in the binary search tree.

  Parameters

  • value: T

    The value to search for.

  Returns boolean

  • True if the value is found, otherwise false.