Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
infix order
0 views
Skip to first unread message
Erik10
Jan 30, 2007, 8:40:43 AM1/30/07
to
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.
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.
Pascal Bourguignon
Jan 30, 2007, 8:57:03 AM1/30/07
to
"Erik10" <orian...@libero.it> writes:
Have a look at:
http://groups.google.com/group/comp.lang.lisp/msg/0c66e597e08be90d
--
__Pascal Bourguignon__ http://www.informatimago.com/
-----BEGIN GEEK CODE BLOCK-----
Version: 3.12
GCS d? s++:++ a+ C+++ UL++++ P--- L+++ E+++ W++ N+++ o-- K- w---
O- M++ V PS PE++ Y++ PGP t+ 5+ X++ R !tv b+++ DI++++ D++
G e+++ h+ r-- z?
------END GEEK CODE BLOCK------
0 new messages