2007/7/15, [EMAIL PROTECTED] <[EMAIL PROTECTED]>:
from YAHT

Exercise 4.9 Write a function elements which returns the elements in a
BinaryTree
 .....

       Any clues on how to proceed?

You have to use pattern-matching on the constructors of the
BinaryTree, with a recursive function. Do you understand that ?

--
Jedaï
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe

Reply via email to