Describe an efficient implementation for printing out the set intersection of two sets represented

with binary search trees. You can either use pseudocode and describe how it functions, or use

only a textual description.

Hint: Use the fact that we can find out the sorted sequence of elements in linear time in the size

of a binary search tree.