This is where we store values in lazy nodes , rather than updating the segment tree itelf Since we don 't need these updated values now  we postpone updates by storing values in lazy[]
lazy [ node << 1 ] = not lazy [ node << 1 ] NEW_LINE lazy [ 1 + ( node << 1 ) ] = not lazy [ 1 + ( node << 1 ) ] NEW_LINE return NEW_LINE