50 lines
1.2 KiB
Haskell
50 lines
1.2 KiB
Haskell
data Tree = Nil | Node Int Tree Tree deriving Show
|
|
|
|
testTree = Node 2
|
|
(Node 4 (Node 9 Nil Nil) (Node 3 Nil (Node 7 Nil Nil)))
|
|
(Node 17 Nil Nil)
|
|
|
|
|
|
|
|
|
|
decTree :: Tree -> Tree
|
|
decTree Nil = Nil
|
|
decTree (Node v l r) = Node (v-1) (decTree l) (decTree r)
|
|
|
|
sumTree :: Tree -> Int
|
|
sumTree Nil = 0
|
|
sumTree (Node v l r) = v + (sumTree l) + (sumTree r)
|
|
|
|
flattenTree :: Tree -> [Int]
|
|
flattenTree Nil = []
|
|
flattenTree (Node v l r) = v : (flattenTree l) ++ (flattenTree r)
|
|
|
|
|
|
|
|
decTree' Nil = Nil
|
|
decTree' (Node v l r) = decN v (decTree' l) (decTree' r)
|
|
decN = \v l r -> Node (v - 1) l r
|
|
|
|
sumTree' Nil = 0
|
|
sumTree' (Node v l r) = sumN v (sumTree' l) (sumTree' r)
|
|
sumN = \v l r -> v + l + r
|
|
|
|
flattenTree' Nil = []
|
|
flattenTree' (Node v l r) = flattenN v (flattenTree' l) (flattenTree' r)
|
|
flattenN = \v l r -> v : l ++ r
|
|
|
|
|
|
|
|
foldTree :: (Int -> a -> a -> a) -> a -> Tree -> a
|
|
foldTree f c Nil = c
|
|
foldTree f c (Node v l r) = f v (foldTree f c l) (foldTree f c r)
|
|
|
|
decTree'' t = foldTree decN Nil t
|
|
sumTree'' t = foldTree sumN 0 t
|
|
flattenTree'' t = foldTree flattenN [] t
|
|
|
|
|
|
prodTree :: Tree -> Int
|
|
prodTree t = foldTree (\v l r -> v * l * r) 1 t
|
|
|
|
incTree t = foldTree (\v l r -> Node (v+1) l r) Nil t
|