Tree traversal: Difference between revisions

→‎Haskell Rose Tree: Corrected treeWidth
(→‎Haskell Rose Tree: Corrected treeWidth)
Line 5,011:
treeSum x xs = x + sum xs
 
treeWidth =_ const[] (foldr (+)= 1)
treeWidth _ xs = sum xs
 
 
treeLeaves :: Tree a -> [a]
treeLeaves = go
where
go (Node x []) = [x]
go (Node _ xs) = xs >>= go
 
--------------------------- TEST -------------------------
Line 5,033 ⟶ 5,041:
print $ levelOrder tree
putStrLn ""
 
(putStrLn . unlines)
( ( \(k, f) ->
Line 5,049 ⟶ 5,057:
]
)
 
justifyLeft, justifyRight :: Int -> Char -> String -> String
9,655

edits