Order Statistics Tree and 1D points problem (interview)?

Question

I ran into an interview question as:

we need a data structure to keep n points on X-axis such that Insert(x), Delete(x) and Find (a, b