rb_next() and rb_prev() return the next and previous nodes in the tree, respectively.

rb_replace_node() allows fast replacement of a single node without having to remove the 
victim, rebalance the tree, insert the replacement and then rebalance again to the original
topology.