I need to take an kth index element from array like data structure and delete it (k is any possible index). Array have O(n) for deleting elements, and List have O(n) for searching element. I would like to do both operations in O(logn) time.
Which data structure should I use to meet this requirement?
Deleting element on index(5) will move element from index(6) to index(5)
the element at index 6 change indexes so that it now has index 5 and 7th element changes to 6th so on ..