iritmaximus/haskell
1
0
Fork 0
mirror of https://github.com/iritmaximus/haskell.git synced 2026-10-12 19:13:39 +03:00
Code Issues Packages Projects Releases Wiki Activity

5b ex5

Browse Source
This commit is contained in:
Aaro Koivukangas
2025-12-24 10:19:02 +02:00
parent 06751c8076
commit cd9ff2fec2
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
exercises/Set5b.hs
+2 -1
View File
@@ -65,7 +65,8 @@ allValues condition Empty = True
-- ==> (Node 2 (Node 3 Empty Empty) (Node 4 Empty Empty))
mapTree :: (a -> b) -> Tree a -> Tree b
mapTree f t = todo
mapTree f (Node value t1 t2) = Node (f value) (mapTree f t1) (mapTree f t2)
mapTree f Empty = Empty
------------------------------------------------------------------------------
-- Ex 6: given a value and a tree, build a new tree that is the same,