• Contents
  • Exercises
  • Leaderboard
  • The book
  • Login
  • Sign up
  • English English
    • Русский Русский
  1. Contents
  2. 2 Building Abstractions with Data
  3. 2.3 Symbolic Data
  4. 2.3.3 Example: Representing Sets
Previous chapter Next chapter
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

Completed by:

  • Pavel
  • Demid Kashirin
  • Anton Burenkov
  • Mikhail Rubashkin
  • Khakim Aidarkhanov
  • misha
  • Кирилл568
  • timon1410
  • Artem Solomatin
  • Дмитрий
  • Maksimov Gleb
  • Stanislav Tanko
  • g7845123

There are no comments yet.

Authentication required

You must log in to post a comment.

Login
  • About
  • Source code
  • Telegram
Help
  • Blog
  • Knowledge
  • Recommended books
OpenSource
  • Hexlet CV
  • Hexlet Editor
  • Hexlet Friends
Extras
  • Code Basics
  • CodeBattle
  • Hexlet Guides