RedBlackTree

RedBlackTree

Class implementing red-black tree

Constructor

new RedBlackTree()

Construct new instance of red-black tree
Source:

Members

isEmpty

Returns true if tree is empty
Source:

keys

Returns arrays of keys stored in the tree
Source:

size

Returns size of the tree
Source:

Methods

find(key, value) → {value|undefined}

Find value stored in the tree by given key. Returns value is key found, otherwise returns undefined
Parameters:
Name Type Description
key * key object
value *
Source:
Returns:
Type
value | undefined

forEach(visitor)

Iterate through entries stored in the tree
Parameters:
Name Type Description
visitor function
Source:

insert(key, value) → {Node}

Insert entry {key[,value]} into the red-black tree
Parameters:
Name Type Description
key * key object, fit to traits interface
value * (optional) value object
Source:
Returns:
- reference to inserted node
Type
Node

remove(key, value) → {boolean}

Remove entry {key,value} stored in the tree
Parameters:
Name Type Description
key
value
Source:
Returns:
Type
boolean