Function

Static Public Summary
public	UnbalancedBST1(compare: *)
public	avlbalance(P: *) -> https://en.wikipedia.org/wiki/AVL_tree
public	find(compare: , node: , value: ):
public	inordertraversal(callback: , node: )
public	insert(compare: , A: , B: ):
public	insertwithparent(compare: , A: , B: ):
public	leftrotate(A: ): -> https://en.wikipedia.org/wiki/Tree_rotation
public	leftrotatewithparent(A: ): -> https://en.wikipedia.org/wiki/Tree_rotation
public	max(node: ):
public	min(node: ):
public	predecessor(compare: , node: , value: , pred: ): * Finds the greatest value in the binary search tree which is smaller than parameter value.
public	range(compare: , node: , value: , iterators: ): *
public	rbinsertfixup(z: node)
public	remove(compare: , node: , value: ):
public	replace(compare: , A: , B: ):
public	rightrotate(B: ): -> https://en.wikipedia.org/wiki/Tree_rotation
public	rightrotatewithparent(B: ): -> https://en.wikipedia.org/wiki/Tree_rotation
public	successor(compare: , node: , value: , succ: ): * Finds the smallest value in the binary search tree which is greater than parameter value.
public	treeinsert(compare: , tree: , node: *)

Static Private Summary
private	__SplayTree1__(diff: ):
private	__SplayTree2__(diff: ):
private	__SplayTree3__(diff: ):
private	__SplayTree4__(diff: ):
private	__SplayTree5__(diff: ):

Static Public

public UnbalancedBST1(compare: *) source

import UnbalancedBST1 from 'aureooms-js-bst/src/UnbalancedBST/UnbalancedBST1.js'

Params:

Name	Type	Attribute	Description
compare	*

public avlbalance(P: *) source

import avlbalance from 'aureooms-js-bst/src/fundamentals/avlbalance.js'

-> https://en.wikipedia.org/wiki/AVL_tree

Params:

Name	Type	Attribute	Description
P	*

public find(compare: , node: , value: ): source

import find from 'aureooms-js-bst/src/fundamentals/find.js'

Params:

Name	Type	Attribute	Description
compare	*
node	*
value	*

Return:

public inordertraversal(callback: , node: ) source

import inordertraversal from 'aureooms-js-bst/src/fundamentals/inordertraversal.js'

Params:

Name	Type	Attribute	Description
callback	*
node	*

public insert(compare: , A: , B: ): source

import insert from 'aureooms-js-bst/src/fundamentals/insert.js'

Params:

Name	Type	Attribute	Description
compare	*
A	*
B	*

Return:

public insertwithparent(compare: , A: , B: ): source

import insertwithparent from 'aureooms-js-bst/src/fundamentals/insertwithparent.js'

Params:

Name	Type	Attribute	Description
compare	*
A	*
B	*

Return:

public leftrotate(A: ): source

import leftrotate from 'aureooms-js-bst/src/fundamentals/leftrotate.js'

-> https://en.wikipedia.org/wiki/Tree_rotation

 A                B
/ \              / \

a B -> A c / \ / \ b c a b

Params:

Name	Type	Attribute	Description
A	*

Return:

public leftrotatewithparent(A: ): source

import leftrotatewithparent from 'aureooms-js-bst/src/fundamentals/leftrotatewithparent.js'

-> https://en.wikipedia.org/wiki/Tree_rotation

 A                B
/ \              / \

a B -> A c / \ / \ b c a b

Params:

Name	Type	Attribute	Description
A	*

Return:

public max(node: ): source

import max from 'aureooms-js-bst/src/fundamentals/max.js'

Params:

Name	Type	Attribute	Description
node	*

Return:

public min(node: ): source

import min from 'aureooms-js-bst/src/fundamentals/min.js'

Params:

Name	Type	Attribute	Description
node	*

Return:

public predecessor(compare: , node: , value: , pred: ): * source

import predecessor from 'aureooms-js-bst/src/fundamentals/predecessor.js'

Finds the greatest value in the binary search tree which is smaller than parameter value.

Params:

Name	Type	Attribute	Description
compare	*
node	*
value	*
pred	*

Return:

public range(compare: , node: , value: , iterators: ): * source

import range from 'aureooms-js-bst/src/fundamentals/range.js'

Params:

Name	Type	Attribute	Description
compare	*
node	*
value	*
iterators	*

Return:

public rbinsertfixup(z: node) source

import rbinsertfixup from 'aureooms-js-bst/src/fundamentals/rbinsertfixup.js'

Params:

Name	Type	Attribute	Description
z	node		the node to fix, z is RED

public remove(compare: , node: , value: ): source

import remove from 'aureooms-js-bst/src/fundamentals/remove.js'

Params:

Name	Type	Attribute	Description
compare	*
node	*
value	*

Return:

public replace(compare: , A: , B: ): source

import replace from 'aureooms-js-bst/src/fundamentals/replace.js'

Params:

Name	Type	Attribute	Description
compare	*
A	*
B	*

Return:

public rightrotate(B: ): source

import rightrotate from 'aureooms-js-bst/src/fundamentals/rightrotate.js'

-> https://en.wikipedia.org/wiki/Tree_rotation

 B                A
/ \              / \

A c -> a B / \ / \ a b b c

Params:

Name	Type	Attribute	Description
B	*

Return:

public rightrotatewithparent(B: ): source

import rightrotatewithparent from 'aureooms-js-bst/src/fundamentals/rightrotatewithparent.js'

-> https://en.wikipedia.org/wiki/Tree_rotation

 B                A
/ \              / \

A c -> a B / \ / \ a b b c

Params:

Name	Type	Attribute	Description
B	*

Return:

public successor(compare: , node: , value: , succ: ): * source

import successor from 'aureooms-js-bst/src/fundamentals/successor.js'

Finds the smallest value in the binary search tree which is greater than parameter value.

Params:

Name	Type	Attribute	Description
compare	*
node	*
value	*
succ	*

Return:

public treeinsert(compare: , tree: , node: *) source

import treeinsert from 'aureooms-js-bst/src/fundamentals/treeinsert.js'

Params:

Name	Type	Attribute	Description
compare	*
tree	*
node	*

Static Private

private SplayTree1(diff: ): source

import __SplayTree1__ from 'aureooms-js-bst/src/SplayTree/__SplayTree1__.js'

Params:

Name	Type	Attribute	Description
diff	*

Return:

private SplayTree2(diff: ): source

import __SplayTree2__ from 'aureooms-js-bst/src/SplayTree/__SplayTree2__.js'

Params:

Name	Type	Attribute	Description
diff	*

Return:

private SplayTree3(diff: ): source

import __SplayTree3__ from 'aureooms-js-bst/src/SplayTree/__SplayTree3__.js'

Params:

Name	Type	Attribute	Description
diff	*

Return:

private SplayTree4(diff: ): source

import __SplayTree4__ from 'aureooms-js-bst/src/SplayTree/__SplayTree4__.js'

Params:

Name	Type	Attribute	Description
diff	*

Return:

private SplayTree5(diff: ): source

import __SplayTree5__ from 'aureooms-js-bst/src/SplayTree/__SplayTree5__.js'

Params:

Name	Type	Attribute	Description
diff	*

Function

Static Public

public UnbalancedBST1(compare: *) source

Params:

public avlbalance(P: *) source

Params:

public find(compare: *, node: *, value: *): * source

Params:

Return:

public inordertraversal(callback: *, node: *) source

Params:

public insert(compare: *, A: *, B: *): * source

Params:

Return:

public insertwithparent(compare: *, A: *, B: *): * source

Params:

Return:

public leftrotate(A: *): * source

Params:

Return:

public leftrotatewithparent(A: *): * source

Params:

Return:

public max(node: *): * source

Params:

Return:

public min(node: *): * source

Params:

Return:

public predecessor(compare: *, node: *, value: *, pred: *): * source

Params:

Return:

public range(compare: *, node: *, value: *, iterators: *): * source

Params:

Return:

public rbinsertfixup(z: node) source

Params:

public remove(compare: *, node: *, value: *): * source

Params:

Return:

public replace(compare: *, A: *, B: *): * source

Params:

Return:

public rightrotate(B: *): * source

Params:

Return:

public rightrotatewithparent(B: *): * source

Params:

Return:

public successor(compare: *, node: *, value: *, succ: *): * source

Params:

Return:

public treeinsert(compare: *, tree: *, node: *) source

Params:

Static Private

private __SplayTree1__(diff: *): * source

Params:

Return:

private __SplayTree2__(diff: *): * source

Params:

Return:

private __SplayTree3__(diff: *): * source

Params:

Return:

private __SplayTree4__(diff: *): * source

Params:

Return:

private __SplayTree5__(diff: *): * source

Params:

Return:

public find(compare: , node: , value: ): source

public inordertraversal(callback: , node: ) source

public insert(compare: , A: , B: ): source

public insertwithparent(compare: , A: , B: ): source

public leftrotate(A: ): source

public leftrotatewithparent(A: ): source

public max(node: ): source

public min(node: ): source

public predecessor(compare: , node: , value: , pred: ): * source

public range(compare: , node: , value: , iterators: ): * source

public remove(compare: , node: , value: ): source

public replace(compare: , A: , B: ): source

public rightrotate(B: ): source

public rightrotatewithparent(B: ): source

public successor(compare: , node: , value: , succ: ): * source

public treeinsert(compare: , tree: , node: *) source

private SplayTree1(diff: ): source

private SplayTree2(diff: ): source

private SplayTree3(diff: ): source

private SplayTree4(diff: ): source

private SplayTree5(diff: ): source