[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]


From: oriana paro
Subject: infixorder
Date: Tue, 30 Jan 2007 14:39:24 +0100

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
       '( (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

reply via email to

[Prev in Thread] Current Thread [Next in Thread]