How can we take out the complexity of the update function(without lazy propagation) in a segment tree.
Now the drawing is not good but i just want to clear my concepts. What would be the O(?) for updating [1,15] (without lazy propagation),Plase help .