An implementation of finite set data type in scheme language, based on 5 underlying data structures:
- red-black tree
- AVL tree
- B tree
- treap
- skiplist
Each one has a terminal demonstration: rbt-demo, avlt-demo, bt-demo, th-demo and sl-demo.
Run with Chez Scheme 9.5