Traversal of Scalaz's Tree Inorder

[Henry Katz]

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

[Dave Stevens]

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.

> --
> 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 scalaz+un...@googlegroups.com.
> To post to this group, send email to sca...@googlegroups.com.
> Visit this group at https://groups.google.com/group/scalaz.
> For more options, visit https://groups.google.com/d/optout.

[Henry Katz]

Understood, it is a rose tree. Not seeking order just thought this would be simpler without having

to reinvent the wheel.

[Henry Katz]

Have had some help from an office colleague that used a recursize list algorithm to resolve this issue.