1. Contents
  2. 2 Building Abstractions with Data
  3. 2.3 Symbolic Data
  4. 2.3.3 Example: Representing Sets
  5. Exercise 2.65
Previous Next
2.3.3. Example: Representing Sets
Exercise 2.65

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.

There are no comments yet.

Authentication required

You must log in to post a comment.

Login