Exercise 2.65: Use the results of Exercise 2.63 
and Exercise 2.64 to give 
  
    Θ
    (
    n
    )
  
 implementations of
union-set and intersection-set for sets implemented as (balanced)
binary trees.107