Tree constructor

Tree constructor with comparer

Add new key into the tree This operation is O(logN) operation

Add new key into the tree or get existing node This operation is O(logN) operation

Balance tree past inserting

Remove all items

Delete the node z, and free up the space

Restore the reb-black properties after a delete

Find key in the dictionary This operation is O(logN) operation

Get first node This operation is O(logN) operation

Get item by order index This operation is O(logN) operation

Get order index of item This operation is O(logN) operation

Get last node This operation is O(logN) operation

Rotate our tree Left X rb_left_rotate(X)---> Y / \ / \ A Y X C / \ / \ B C A B N.B. This does not change the ordering. We assume that neither X or Y is NULL

Create new node

Get next node This operation is O(logN) operation

Return a pointer to the largest key smaller than x

Get previous node This operation is O(logN) operation

Remove key from the dictionary This operation is O(logN) operation

Rotate our tree Right X Y / \ / \ A Y leftArrow--rb_right_rotate(Y) X C / \ / \ B C A B N.B. This does not change the ordering. We assume that neither X or Y is NULL

Return a pointer to the smallest key greater than x

Get collection object for this

Number of nodes in the tree

Root of the tree

Object can be used for synchronization

Is tree unique

Get enumerator

Get enumerator

Get item by order index

Get index by item

Get first node

Get last node

Get prior node

Get next node

Add item

Add or get item

Clear

Find item

Delete item by key

Delete item by key