scalaz.Tree is not a binary tree. It supports an arbitrary number of arbitrary number of children. You could probably shoe-horn some abstraction on top of it, but you're probably asking the wrong list if you are going to attempt something like that. If you need a binary tree, you would be better off using a type more accurately defining a binary tree.
On Wed, Apr 5, 2017 at 3:00 AM, Henry Katz <[email protected]> wrote: > Hi, > > Has anyone run across a method to perform an InOrder traversal of this Tree > which comes with a PRE and a BFS order but not > an InOrder Traversal? > > https://github.com/scalaz/scalaz/blob/series/7.3.x/core/src/main/scala/scalaz/Tree.scala > > -- > You received this message because you are subscribed to the Google Groups > "scalaz" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To post to this group, send email to [email protected]. > Visit this group at https://groups.google.com/group/scalaz. > For more options, visit https://groups.google.com/d/optout. -- You received this message because you are subscribed to the Google Groups "scalaz" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/scalaz. For more options, visit https://groups.google.com/d/optout.
