data structure that have these properties ?

is there a data structure (to contain sorted elements) where you can access items by indices and at the same time insert items at O(log n) ?
Topic archived. No new replies allowed.