2.3 Symbolic Data

2.3.3 Example: Representing Sets

Exercises:

• 2.59 . Union-set for sets represented as unordered lists
• 2.60 . Set with duplicates
• 2.61 . Adjoin-set for the ordered representation
• 2.62 . Union-set for for sets represented as ordered lists
• 2.63 . Converting a binary tree to a list
• 2.64 . Partial-tree procedure
• 2.65 . Procedures for sets implemented as (balanced) binary trees
• 2.66 . Lookup procedure