org.isarnproject.collections.mixmaps.nearest.tree
create a new Black node from a key, value, left subtree and right subtree
create a new Black node from a key, value, left subtree and right subtree
Obtain the nearest nodes to a given key
Obtain the node stored at a given key if it exists, None otherwise
create a new Red node from a key, value, left subtree and right subtree
create a new Red node from a key, value, left subtree and right subtree
Leaf R/B tree nodes supporting nearest-key query