Data structure that keeps elements in chronological order, allows erases in O(log(n)) or less, and allows insertions.

Правка en1, от Qualified, 2020-10-03 01:11:19

I want a data structure that keeps elements in the way that you inserted them and allows erases in $$$O(log(n))$$$ or less. For example, if the initial array is empty and you insert 5, 2, 4, then the array would be [5, 2, 4]. Erase 4 and it is [5, 2]. Insert a 3 and it is [5, 2, 3].

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Qualified 2020-10-03 01:18:54 140
en1 Английский Qualified 2020-10-03 01:11:19 397 Initial revision (published)