Home > Archive > Scheme > November 2004 > A scheme question,please help me
You are viewing an archived Text-only version of the thread.
To view this thread in it's original format and/or if you want to reply to
this thread please [click here]
| Author |
A scheme question,please help me
|
|
|
| Use high order functions to define a mintree(TreeList) which returns a
new
BSetT with all the minimum elements from the TreelistTreelist is a
list of
BSetT. I have already solved most part of this question such as change
tree
to a set list and flatten all the set list. Since I am not familiar
with high
order function,I do not use map or apply to get the list.
For example,if the function is getmin,I need to use the (getmin '((1 2
3) (3 4 5)(6 7 8)(2 3 4)....) to get (1 3 6 2....) and then I can use
SetToTree to get
the mintree. I really appreciate your help.
|
|
|
|
|