Class BinarySearchTreeNode<T>

Represents a single element of a tree. Carrying a given value, it is linked to maximum two child nodes via left and right fields.

Type parameters

T

Hierarchy

BinarySearchTreeNode

Index

Constructors

constructor

Properties

Methods

Constructors

constructor

new BinarySearchTreeNode(value: T): BinarySearchTreeNode

- Defined in tree/binary-search-tree.ts:27
Parameters
- value: T
Returns BinarySearchTreeNode

Properties

Optional left

left: BinarySearchTreeNode<T>

Optional right

right: BinarySearchTreeNode<T>

value

value: T

Methods

getChild

getChild(direction: -1 | 1): undefined | BinarySearchTreeNode<T>

- Defined in tree/binary-search-tree.ts:58
Returns the current node's child in the given direction (can be undefined).

Values -1 (left) or 1 (right) for the direction input are used for convenience, as it is the direct result of the CompareFunction. Case 0 is not treated as it is considered already checked.

Parameters
- direction: -1 | 1
  
  -1 (left) / 1 (right).
Returns undefined | BinarySearchTreeNode<T>

a child BinarySearchTreeNode or undefined.

hasChild

hasChild(direction: -1 | 1): boolean

- Defined in tree/binary-search-tree.ts:43
Whether the current node has a child in the given direction.

Values -1 (left) or 1 (right) for the direction input are used for convenience, as it is the direct result of the CompareFunction. Case 0 is not treated as it is considered already checked.

Parameters
- direction: -1 | 1
  
  -1 (left) / 1 (right).
Returns boolean

true / false.

setChild

setChild(direction: -1 | 1, newNode: BinarySearchTreeNode<T>): void

- Defined in tree/binary-search-tree.ts:68
Sets the current node's child in the given direction.

Parameters
- direction: -1 | 1
  
  -1 (left) / 1 (right).
- newNode: BinarySearchTreeNode<T>
  
  The new Child.
Returns void

Generated using TypeDoc