[Haskell-cafe] String to binary tree

[Bulat Ziganshin]

Hello Nuno,

Monday, May 29, 2006, 10:53:30 PM, you wrote:

> I have this type which represents polish expressions (floorplan
> representation):

> data PeAux a = Folha Char | Nodo Char (PeAux a) (PeAux a)  deriving Show

> The reverse polish expression are the result of doing a post order  
> visit to the tree

to be exact, tree represents an expression itself while you can get
_linear_ text from it in polish postfix/prefix or ordinary infix
notation by applying various visiting strategies


-- 
Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com