Balanced trees and quotient set 
Author Message
 Balanced trees and quotient set


I'm looking for two Scheme functions:

- one that tests if a tree is balanced, i.e. for each node, the right
weight is equal to the left weight, e.g.:
(4 (1 2 3) (3 1 2)) is balanced
(3 (3 1 1) (1 1 2)) is not

- one that, given the graph of an equivalence relation R on the set A
(implemented as a list), computes the quotient set A/R.

Article post via l'accs Usenet http://www.*-*-*.com/
Accs par Nnrp ou Web

Fri, 28 Oct 2005 09:23:18 GMT  
 Balanced trees and quotient set


>I'm looking for two Scheme functions:

This sounds like homework.  You need to convince us that it's not
homework, or at least show us what you've tried so far and
explain what you're having trouble with.


Fri, 28 Oct 2005 09:30:36 GMT  
 [ 2 post ] 

 Relevant Pages 

1. Where to find implementation of balanced trees

2. wanted, balanced binary tree package

3. Height-balanced tree, source code wanted.

4. newbie: balanced tree module

5. need some fast balanced-tree datastructure

6. Balanced Trees or other mutable sequences?

7. avl-2.0, a balanced binary tree extension

8. balanced insertion into complete trees

9. re-usable software wanted: balanced trees (and more)

10. n-ary/balanced binary trees in Common Lisp

11. balanced tree routines in Scheme/LISP

12. Balanced binary tree in Haskell


Powered by phpBB® Forum Software