Hi. I'm learning scheme (Guile) and I have some problem with the infix order
walk in a tree...
I want to write a function infixwalk that walks though a tree in infix order
(left tree - node - righ tree) so that the call
(equal?
(infixwalk
'( (a) b ( (c) d (e) ) )
)
'(b a d c e)
)
returns #t.
Anyone can help me?? Thanks in advance.
------------------------------------------------------
Passa a Infostrada. ADSL e Telefono senza limiti e senza canone Telecom
http://click.libero.it/infostrada30gen07
_______________________________________________
Guile-user mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/guile-user
