Problem with RB trees

Hi all, i'm hopeless, i need to do a red black tree , to solove the
dictionary problem. and i need insert and delete in O(1) (it's easy:
lazy deletion), insert O(1), find worst case O(nlogn). amortized all
O(logn).

thanks.

.