# SICP Solutions

### Section - 2.3 Symbolic Data

#### Exercise 2.60

Only changes are in adjoin-set and union-set. Procedure adjoin-set have $\theta(1)$ time complexity and procedure union-set have $\theta(n)$ time complexity.

Clearly the preferred places for this representation are those where it is required to collect/write/create the elements of the set most of the times and only rarely we check presence of element in the set.