RedBlackTree.insert
Puts a value with a key to the tree, overwriting an old value if the key already exists.
Arguments
key
for the entry to put.value
of the entry to put.
Return values
None
Complexity
O(log(size))
Example
Output:
{ key: 4; value: "bbb"; }
{ key: 12; value: "aaa"; }