Lakh's blog

Point Updates In Merge Sort Tree
By Lakh, history, 7 years ago, In English

I know how to build and perform queries on a merge sort tree. But how to do point updates in the merge sort tree efficiently

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

Comments Comments (6)
| Write comment?
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Have you checked this ?
See the last part.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yes I have already read this article but just wanted to know if there is some other technique apart from policy based data structures to perform updates

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
      ← Rev. 2   Vote: I like it 0 Vote: I do not like it

      You can keep implicit segment tree in each node so that you can update and query in O(log^2(N)).

      → Reply
»
5 years ago, # |
  Vote: I like it -10 Vote: I do not like it

Check out this blog on the implementation of Point updates in merge sort trees.

→ Reply