blob: efe858829942b6c6bf6a7bca99927e5e7a39d1ed (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
import Data.List (foldl')
data Tree a = Empty | Branch a (Tree a) (Tree a) deriving (Show, Eq)
symmetric :: (Eq a) => Tree a -> Bool
mirror :: (Eq a) => Tree a -> Tree a -> Bool
mirror Empty Empty = True
mirror (Branch _ a b) (Branch _ l r) = mirror a r && mirror b l
mirror _ _ = False
symmetric Empty = True
symmetric (Branch _ l r) = mirror l r
construct :: [Int] -> Tree Int
addNode :: Tree Int -> Int -> Tree Int
addNode Empty n = Branch n Empty Empty -- create node
addNode (Branch x l r) n
| n <= x = Branch x (addNode l n) r
| otherwise = Branch x l (addNode r n)
construct l = foldl' (\acc n -> addNode acc n) Empty l
|