If step 3 can be accomplished with local information (x, left(x), right(x), f(left(x)), f(right(x))) in RB Tree, then augmentation does not affect O(lg n) performance.