Is there some Segment tree / AVL tree structure with specific operations?

Правка en2, от luczki602, 2023-03-30 21:50:20

Hello,

Quick question! I can't really find any structure in O(log n) with those operations on increasing sequence of integer numbers: i. adding new element / shifting range of subsequence ii. adding value to all elements of subsequence iii. binsearch first element >= value

I thought that maybe AVL tree would be sensible, but didn't code any and I couldn't find any blog with AVL tree structure with adding value to range.

Thanks for any response in advance!

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский luczki602 2023-03-30 21:50:20 2
en1 Английский luczki602 2023-03-30 21:50:07 548 Initial revision (published)