Class BinarySearchTree<T>

TODO: add comparator

Type parameters

T: number

Hierarchy

BinarySearchTree

Implements

G43Collection<T>

Index

Constructors

constructor

Properties

_length
root

Accessors

length

Methods

Constructors

constructor

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

- Defined in src/models/data-structures/binary-tree.ts:22
Type parameters
- T: number
Parameters
- rootValue: T
Returns BinarySearchTree<T>

Properties

Private _length

_length: number = 0

root

root: null | Node<T>

Accessors

length

get length(): number

Implementation of G43Collection.length
- Defined in src/models/data-structures/binary-tree.ts:18
Returns number

Methods

add

add(newValue: T): void

Implementation of G43Collection.add
- Defined in src/models/data-structures/binary-tree.ts:44
Parameters
- newValue: T
Returns void

Private addInternally

addInternally(currentNode: null | Node<T>, newValue: T): Node<T>

- Defined in src/models/data-structures/binary-tree.ts:31
Parameters
- currentNode: null | Node<T>
- newValue: T
Returns Node<T>

clear

clear(): void

Implementation of G43Collection.clear
- Defined in src/models/data-structures/binary-tree.ts:26
Returns void

contains

contains(value: T): boolean

Implementation of G43Collection.contains
- Defined in src/models/data-structures/binary-tree.ts:107
Parameters
- value: T
Returns boolean

forEach

forEach(callback: (item: T, index: number) => boolean): void

Implementation of G43Collection.forEach
- Defined in src/models/data-structures/binary-tree.ts:53
Parameters
- callback: (item: T, index: number) => boolean
  - - (item: T, index: number): boolean
    - Parameters
      - item: T
      - index: number
      Returns boolean
Returns void

forEachInternally

forEachInternally(currentNode: null | Node<T>, callback: (item: T, index: number) => boolean): void

- Defined in src/models/data-structures/binary-tree.ts:77
Parameters
- currentNode: null | Node<T>
- callback: (item: T, index: number) => boolean
  - - (item: T, index: number): boolean
    - Parameters
      - item: T
      - index: number
      Returns boolean
Returns void

forEachOrderedInternally

forEachOrderedInternally(currentNode: null | Node<T>, callback: (item: T, index: number) => boolean, order: "POST" | "PRE"): void

- Defined in src/models/data-structures/binary-tree.ts:57
Parameters
- currentNode: null | Node<T>
- callback: (item: T, index: number) => boolean
  - - (item: T, index: number): boolean
    - Parameters
      - item: T
      - index: number
      Returns boolean
- order: "POST" | "PRE"
Returns void

remove

remove(value: T): boolean

Implementation of G43Collection.remove
- Defined in src/models/data-structures/binary-tree.ts:111
Parameters
- value: T
Returns boolean

Private removeInternally

removeInternally(currentNode: null | Node<T>, value: T): boolean

- Defined in src/models/data-structures/binary-tree.ts:121
Parameters
- currentNode: null | Node<T>
- value: T
Returns boolean

search

search(value: T): null | Node<T>

- Defined in src/models/data-structures/binary-tree.ts:103
Parameters
- value: T
Returns null | Node<T>

Private searchInternally

searchInternally(currentNode: null | Node<T>, value: T): null | Node<T>

- Defined in src/models/data-structures/binary-tree.ts:86
Parameters
- currentNode: null | Node<T>
- value: T
Returns null | Node<T>

Generated using TypeDoc