<table cellspacing="0" cellpadding="0" border="0" ><tr><td valign="top" style="font: inherit;">Example understood. Thanks.<br><br>Is there a module for binary trees?<br><br>Michael<br><br>--- On <b>Wed, 6/10/09, wren ng thornton <i><wren@freegeek.org></i></b> wrote:<br><blockquote style="border-left: 2px solid rgb(16, 16, 255); margin-left: 5px; padding-left: 5px;"><br>From: wren ng thornton <wren@freegeek.org><br>Subject: Re: [Haskell-cafe] Building a tree?<br>To: haskell-cafe@haskell.org<br>Date: Wednesday, June 10, 2009, 8:13 PM<br><br><div class="plainMail">michael rice wrote:<br>> Here's a function from Data.Tree:<br>> <br>> unfoldTree :: (b -> (a, [b])) -> b -> Tree a<br>> Build a tree from a seed value<br>> <br>> Could someone please give me a brief example of usage.<br><br> Data.Tree> let t = unfoldTree (\i -> (show i, [i`div`2..i-1]))<br> Data.Tree> putStr . drawTree $ t
8<br><br>-- Live well,<br>~wren<br>_______________________________________________<br>Haskell-Cafe mailing list<br><a ymailto="mailto:Haskell-Cafe@haskell.org" href="/mc/compose?to=Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br><a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br></div></blockquote></td></tr></table><br>