Else query for the right and left child node of this subtree and merge them
int mid = ( ns + ne ) >> 1 ; RangeUpdate ( us , ue , ns , mid , ind << 1 ) ; RangeUpdate ( us , ue , mid + 1 , ne , ind << 1 1 ) ; node l = seg [ ind << 1 ] , r = seg [ ind << 1 1 ] ; seg [ ind ] = MergeUtil ( l , r ) ; }