Given two Binary Search Trees consisting of unique positive elements, write an algorithm

to check whether the two BSTs contain the same set of elements or not.

Note: The structure of the two given BSTs can be different.

For example,

The above two BSTs contains same set of elements $\{5,10,12,15,20,25\}$