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

From: Matthias Felleisen (matthias at ccs.neu.edu)
Date: Fri Feb 20 09:04:20 EST 2009

Thank you Marco for reading my mind with both messages.

Charlie, this list is open to discussion -- if you bring your  
thoughts to the table, i.e., you spell out your steps according to  
the design recipe. For all we know, you have followed this stupid,  
little thing all along but it lead you astray. If so, be friendly and  
share your steps with us. If not, please go slow so that you arrive  
at the solution faster.

CS 101 is Thinking 101. The solution is irrelevant; the way to the  
solution is the only thing that matters.

-- Matthias

On Feb 20, 2009, at 8:59 AM, Marco Morazan 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
> _________________________________________________
>   For list-related administrative tasks:
>   http://list.cs.brown.edu/mailman/listinfo/plt-scheme

Posted on the users mailing list.