[plt-scheme] Binary tree Traversals

There are plenty of books that explain list and cons and how they  
differ. Have you worked thru the examples?




On Oct 12, 2008, at 1:28 AM, Shrutarshi Basu wrote:

> Veer's solution worked. Thanks. I was under the impression that list
> accepted only two inputs and then combined them. I can see that append
> might give problems in my original code, because it would not always
> get a list as input. Doing (cons (label node) '()) takes care of this,
> I think. I'm still not sure I quite understand list and append though.
> Could someone give me a brief rundown?
> Thanks,
> Basu
>
> -- 
> The ByteBaker :
> http://www.bytebaker.com
> _________________________________________________
>   For list-related administrative tasks:
>   http://list.cs.brown.edu/mailman/listinfo/plt-scheme