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