Make pending updates to this node . Note that this node represents sum of elements in arr [ st . . en ] and all these elements must be increased by lazy [ node ]
lazy [ node ] = false ; tree [ node ] = en - st + 1 - tree [ node ] ;