Home › Exercise 2.65 ›

Reply to comment

Exercise 2.65

in
Printer-friendly versionPrinter-friendly version

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.[41]

[41] Exercises 2.63-2.65 are due to Paul Hilfinger. [back]
Corresponding Section: 
2.3.3 Example: Representing Sets

Reply

  • Web page addresses and e-mail addresses turn into links automatically.
  • Allowed HTML tags: <a> <em> <strong> <cite> <code> <pre> <hr> <ul> <ol> <li> <dl> <dt> <dd> <img>
  • Lines and paragraphs break automatically.
  • Adds typographic refinements.

More information about formatting options