2.3.3. Example: Representing Sets
Procedures for sets implemented as (balanced) binary trees
Use the results of exercises 2.63 and 2.64 to give Θ(n) implementations of union-set and intersection-set for sets implemented as (balanced) binary trees.