[plt-scheme] Excersise 14.2.3 - HtDP - Ordered list of binary tree nodes

My main purpose was only to make him aware of the definition of
inorder , if he does
not know what does inorder means , then design recipe is not going to
help anyway,
unless he tries all the combinations.From his code i am 100% sure if he knew
what inorder means , he would have solved the problem.

Sorry , if it was terrible suggestion , i thought otherwise.


On Fri, Feb 20, 2009 at 7:29 PM, Marco Morazan <morazanm at gmail.com> wrote:
> On Fri, Feb 20, 2009 at 8:53 AM, Veer <diggerrrrr at gmail.com> wrote:
>> Hello,
>>
>> See this http://en.wikipedia.org/wiki/Tree_traversal
>>
>
> With respect, that is a terrible suggestion. The whole purpose of the
> exercise is to gain experience using the design recipe with trees and
> to gain experience with using append. After solving the problem using
> the DR, Charlie, take a look at the suggested site to discover that
> you obtained the same result without "cheating."
>
> You can not learn how to exploit structural recursion by copying
> answers from others.
>
> --
>
> Cheers,
>
> Marco
>