Usually the wavelet tree is made not to support updates. I wonder what types of updates it can recieve that will still keep all its operations in $O(\log{}A)$, where $A$ is the range of values it gets. For instance the only one I found is that you can support appending or removing the element from the back of the array (on which the wavelet is built).↵
↵
A short tutorial for this data structure can be found [here](http://codeforces.com/blog/entry/52854), for those who are interested.
↵
A short tutorial for this data structure can be found [here](http://codeforces.com/blog/entry/52854), for those who are interested.
