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 ex3

Browse Source
This commit is contained in:
Aaro Koivukangas
2025-12-24 10:13:07 +02:00
parent 9bc9c12a43
commit 062510bfcf
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
@@ -39,7 +39,8 @@ treeSize Empty = 0
-- treeMax (Node 3 (Node 5 Empty Empty) (Node 4 Empty Empty)) ==> 5 -- treeMax (Node 3 (Node 5 Empty Empty) (Node 4 Empty Empty)) ==> 5
treeMax :: Tree Int -> Int treeMax :: Tree Int -> Int
treeMax = todo treeMax (Node value t1 t2) = if value >= max (treeMax t1) (treeMax t2) then value else if treeMax t1 > treeMax t2 then treeMax t1 else treeMax t2
treeMax Empty = 0
------------------------------------------------------------------------------ ------------------------------------------------------------------------------
-- Ex 4: implement a function that checks if all tree values satisfy a -- Ex 4: implement a function that checks if all tree values satisfy a