Haskell - 12.12.13 (Sakontrolosi)

data Notebook = Reminder String Int Int | Tel String Int | Meeting Int Int Int String deriving(Eq, Show)

getMyDate :: Int -> Int -> [Notebook] -> [String]
getMyDate a b [] = []
getMyDate a b ((Reminder name c d):xs) =    if (a==c && b==d) then name:(getMyDate a b xs)
                        else (getMyDate a b xs)
getMyDate a b (x:xs) = getMyDate a b xs
-----------------------

mySum xs = foldr (+) 0 xs
myAnd xs = foldr (&&) True xs
-----------------------
data Tree a = Node a [Tree a]

levelList :: Int -> Tree a -> [a]
levelList num (Node b []) =     if (num == 1) then [b]
                else []
levelList num (Node b (x:xs)) = if (num == 1) then [b]
                else (levelList (num-1) x) ++ (levelList num (Node b xs))
-----------------------
myDelete :: Char -> String -> String
myDelete chr str = filter (\x -> x /= chr) str