luczki602's blog

By luczki602, history, 2 months ago, In English


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!

  • Vote: I like it
  • +7
  • Vote: I do not like it

2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

It's called Treap. I think here is a good lecture: