Unique elements in a range

I was studying the merge sort tree algorithm,can someone please share the idea how to find the number of unique elements in the given range l,r using the merge sort tree algo