SICP Solutions

Section - 2.3 Symbolic Data

Exercise 2.65

This can be done in following steps:

• Convert both trees of the sets using part(a) into ordered list.
• Use union-set and intersection-set procedure of ordered list from previous section to get a set in oredered list representation.
• Convert the ordered list into tree with part(b).

Clearly all of these parts are of $O(n)$ complexity. The overall complexity will be $O(n)$.