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 ex6

Browse Source
This commit is contained in:
Aaro Koivukangas
2025-12-24 13:23:18 +02:00
parent cd9ff2fec2
commit aba0c1d0b1
1 changed files with 4 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
exercises/Set5b.hs
+4 -1
View File
@@ -110,7 +110,10 @@ mapTree f Empty = Empty
-- (Node 3 Empty Empty))
cull :: Eq a => a -> Tree a -> Tree a
cull val tree = todo
cull val (Node value t1 t2)
| val == value = Empty
| otherwise = Node value (cull val t1) (cull val t2)
cull val Empty = Empty
------------------------------------------------------------------------------
-- Ex 7: check if a tree is ordered. A tree is ordered if: