True when Value is associated with Key in the Red-Black tree Tree.
The given Key may include variables, in which case the RB tree is
searched for a key with equivalent, as in (==)/2, variables. Time
complexity is O(log N) in the number of elements in the tree.
Tag confusing pages with doc-needs-help|Tags are associated to your profile if you are logged in