What is the best data structure (container) for quickly inserting / deleting items by index?

Question

What is the best data structure (container) for quickly inserting / deleting items by index?

Answer 1

You can get O (log n) performance using a binary tree with a node structure like this:

struct Node<T>
    T value
    Node left
    int left_count
    Node right
    int right_count
end

left_count left . , , . count. .

, , ; !

Answer 2

, - . - B-, ( , node ).

Answer 3

Try a hash table dynamically resized at fixed intervals.

Assuming a pretty good uniform distribution, you should have basically constant access time [O (1)].

http://www.cs.cornell.edu/courses/cs312/2006fa/lectures/lec14.html

This link seems to give a good explanation.