Hello,
I've a question regarding the usage of the red black tree done by the
scheduler. It seems that nodes with the same keys are allowed. However
I'm not sure if this is correct since rotations can break the binary
search tree property (key(left) < key(node) <= key(right)) in that
case. I'm not sure about the consequence though.
Could anybody confirm that this won't hurt ?
Thanks
--
Francis