You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
sicp-all-tasks/sicp/2_002e65

12 lines
211 B

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