Tree traversal: Difference between revisions

const preorder = x =>

xs => [x, ...xs.flat()];

 

// inorder :: a -> [[a]] -> [a]

[...xs[0], x, ...xs.slice(1).flat()]

) : [x];

 

// postorder :: a -> [[a]] -> [a]

const postorder = x =>

xs => [...xs.flat(), x];

 

// levelOrder :: Tree a -> [a]