title: Possible to update nodes key in a red-black tree, without removing and inserting?
body: <p>Typically changes to a key in a red-black tree need to be performed by removing, then re-inserting the node.</p>
  
  <p>Is it possible to performs key updates to a node in a red black tree that is more efficient than delete+insert?</p>