Home Manual Reference Source Repository

References

References

Function Summary

Static Public Function Summary
public

UnbalancedBST1(compare: *)

public

avlbalance(P: *)

public

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

public

inordertraversal(callback: *, node: *)

public

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

public

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

public

leftrotate(A: *): *

public
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: *): *

public
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 Function Summary
private

__SplayTree1__(diff: *): *

private

__SplayTree2__(diff: *): *

private

__SplayTree3__(diff: *): *

private

__SplayTree4__(diff: *): *

private

__SplayTree5__(diff: *): *