Class AVLTree<T>

Type parameters

T

Hierarchy

BinarySearchTree<T>
- AVLTree

Implements

IBinaryTree<T>
IBinarySearchTree<T>

Index

Constructors

constructor

Properties

Accessors

Methods

Constructors

constructor

new AVLTree(compareFunction?: CompareFunctionType<T>): AVLTree

Inherited from BinarySearchTree.constructor
- Defined in BinaryTree/BinarySearchTree.ts:22
Parameters
- Optional compareFunction: CompareFunctionType<T>
Returns AVLTree

Properties

Protected _head

_head: IBinaryTreeNode<T>

Protected compareFunction

compareFunction: CompareFunctionType<T> = descendingCompareFunction

Accessors

head

get head(): IBinaryTreeNode<T>

Inherited from BinaryTree.head
- Defined in BinaryTree/BinaryTree.ts:74
Returns IBinaryTreeNode<T>

max

get max(): T

Inherited from BinarySearchTree.max
- Defined in BinaryTree/BinarySearchTree.ts:59
Returns T

min

get min(): T

Inherited from BinarySearchTree.min
- Defined in BinaryTree/BinarySearchTree.ts:47
Returns T

Methods

add

add(value: T): void

Implementation of IBinarySearchTree.add

Overrides BinarySearchTree.add
- Defined in BinaryTree/AVLTree.ts:5
Parameters
- value: T
Returns void

Private balanceNode

balanceNode(node: IBinaryTreeNode<T>): void

- Defined in BinaryTree/AVLTree.ts:9
Parameters
- node: IBinaryTreeNode<T>
Returns void

delete

delete(value: T): void

Inherited from BinarySearchTree.delete
- Defined in BinaryTree/BinarySearchTree.ts:43
Parameters
- value: T
Returns void

findNode

findNode(value: T, node?: IBinaryTreeNode<T>): IBinaryTreeNode<T>

Inherited from BinaryTree.findNode
- Defined in BinaryTree/BinaryTree.ts:154
Parameters
- value: T
- Default value node: IBinaryTreeNode<T> = this.head
Returns IBinaryTreeNode<T>

Protected insertNode

insertNode(value: T, node: IBinaryTreeNode<T>): IBinaryTreeNode<T>

Inherited from BinarySearchTree.insertNode
- Defined in BinaryTree/BinarySearchTree.ts:70
Parameters
- value: T
- node: IBinaryTreeNode<T>
Returns IBinaryTreeNode<T>

leftRightRotate

leftRightRotate(node: IBinaryTreeNode<T>): void

- Defined in BinaryTree/AVLTree.ts:56
Parameters
- node: IBinaryTreeNode<T>
Returns void

leftRotate

leftRotate(node: IBinaryTreeNode<T>): void

- Defined in BinaryTree/AVLTree.ts:36
Parameters
- node: IBinaryTreeNode<T>
Returns void

remove

remove(value: T): void

Implementation of IBinarySearchTree.remove

Inherited from BinaryTree.remove
- Defined in BinaryTree/BinaryTree.ts:103
Parameters
- value: T
Returns void

rightLeftRotate

rightLeftRotate(node: IBinaryTreeNode<T>): void

- Defined in BinaryTree/AVLTree.ts:81
Parameters
- node: IBinaryTreeNode<T>
Returns void

rightRotate

rightRotate(node: IBinaryTreeNode<T>): void

- Defined in BinaryTree/AVLTree.ts:61
Parameters
- node: IBinaryTreeNode<T>
Returns void

toArray

toArray(): T[]

Implementation of IBinarySearchTree.toArray

Inherited from BinaryTree.toArray
- Defined in BinaryTree/BinaryTree.ts:131
Returns T[]

valueExists

valueExists(value: T): boolean

Implementation of IBinarySearchTree.valueExists

Inherited from BinaryTree.valueExists
- Defined in BinaryTree/BinaryTree.ts:168
Parameters
- value: T
Returns boolean

Generated using TypeDoc