Hello,

I am looking for a structure that allows me to:

1. Append in O(logN) or better
2. Delete in O(logN) or better
3. Access the ith item in O(1)

I don't need any other operations

In addition, new items are always greater (>) than existing items (the structure is always sorted) and no item appears twice.

Maybe, I think it is impossible...