Else query for the right and left child node of this subtree and merge them
int mid = ( ns + ne ) >> 1 ; node l = Query ( qs , qe , ns , mid , ind << 1 ) ; node r = Query ( qs , qe , mid + 1 , ne , ind << 1 1 ) ; x = MergeUtil ( l , r ) ; return x ; }