Class BinarySearchTree<T>

Type Parameters

T

Hierarchy

BinarySearchTree

Index

Constructors

Properties

comparator root

Methods

delete deleteNode findMax findMin inOrder inOrderTraversal insert insertNode isEmpty max min postOrder postOrderTraversal preOrder preOrderTraversal search searchNode defaultComparator

Constructors

constructor

new BinarySearchTree<T>(comparator?): BinarySearchTree<T>
Type Parameters
- T
Parameters
- comparator: ((a, b) => number) = BinarySearchTree.defaultComparator
  - - (a, b): number
    - Parameters
      
      a: T
      
      b: T
      
      Returns number
Returns BinarySearchTree<T>
- Defined in datastructures/BinarySearchTree.ts:34

Properties

`Private` comparator

comparator: ((a, b) => number)

Type declaration

- (a, b): number
- Parameters
  - a: T
  - b: T
  Returns number

`Private` root

root: null | BSTNode<T>

Methods

delete

delete(value): void
Deletes a value from the BST
Parameters
- value: T
Returns void
- Defined in datastructures/BinarySearchTree.ts:102

`Private` deleteNode

deleteNode(node, value): null | BSTNode<T>
Helper method to recursively delete a node
Parameters
- node: null | BSTNode<T>
- value: T
Returns null | BSTNode<T>
- Defined in datastructures/BinarySearchTree.ts:109

`Private` findMax

findMax(node): BSTNode<T>
Finds the maximum value node in a subtree
Parameters
- node: BSTNode<T>
Returns BSTNode<T>
- Defined in datastructures/BinarySearchTree.ts:149

`Private` findMin

findMin(node): BSTNode<T>
Finds the minimum value node in a subtree
Parameters
- node: BSTNode<T>
Returns BSTNode<T>
- Defined in datastructures/BinarySearchTree.ts:139

inOrder

inOrder(): T[]
Returns an in-order traversal of the BST

Returns T[]
- Defined in datastructures/BinarySearchTree.ts:175

`Private` inOrderTraversal

inOrderTraversal(node, result): void
Helper method for in-order traversal
Parameters
- node: null | BSTNode<T>
- result: T[]
Returns void
- Defined in datastructures/BinarySearchTree.ts:184

insert

insert(value): void
Inserts a value into the BST
Parameters
- value: T
Returns void
- Defined in datastructures/BinarySearchTree.ts:51

`Private` insertNode

insertNode(node, value): BSTNode<T>
Helper method to recursively insert a node
Parameters
- node: null | BSTNode<T>
- value: T
Returns BSTNode<T>
- Defined in datastructures/BinarySearchTree.ts:58

isEmpty

isEmpty(): boolean
Returns true if the tree is empty

Returns boolean
- Defined in datastructures/BinarySearchTree.ts:235

max

max(): null | T
Returns the maximum value in the BST

Returns null | T
- Defined in datastructures/BinarySearchTree.ts:167

min

min(): null | T
Returns the minimum value in the BST

Returns null | T
- Defined in datastructures/BinarySearchTree.ts:159

postOrder

postOrder(): T[]
Returns a post-order traversal of the BST

Returns T[]
- Defined in datastructures/BinarySearchTree.ts:215

`Private` postOrderTraversal

postOrderTraversal(node, result): void
Helper method for post-order traversal
Parameters
- node: null | BSTNode<T>
- result: T[]
Returns void
- Defined in datastructures/BinarySearchTree.ts:224

preOrder

preOrder(): T[]
Returns a pre-order traversal of the BST

Returns T[]
- Defined in datastructures/BinarySearchTree.ts:195

`Private` preOrderTraversal

preOrderTraversal(node, result): void
Helper method for pre-order traversal
Parameters
- node: null | BSTNode<T>
- result: T[]
Returns void
- Defined in datastructures/BinarySearchTree.ts:204

search

search(value): boolean
Searches for a value in the BST
Parameters
- value: T
Returns boolean
- Defined in datastructures/BinarySearchTree.ts:77

`Private` searchNode

searchNode(node, value): boolean
Helper method to recursively search for a node
Parameters
- node: null | BSTNode<T>
- value: T
Returns boolean
- Defined in datastructures/BinarySearchTree.ts:84

`Static` defaultComparator

defaultComparator(a, b): number
Default comparator function
Parameters
- a: any
- b: any
Returns number
- Defined in datastructures/BinarySearchTree.ts:42

Generated using TypeDoc