Cvicenie 3

cv3.hs

-- # --------------------------------------------------------------------------
-- # Enumeracne typy
-- # --------------------------------------------------------------------------

data Eval = A|B|C|D|E|FX deriving(Show, Eq, Ord, Enum)

-- # --------------------------------------------------------------------------
-- # Dni
-- # --------------------------------------------------------------------------

data Dni = Po|Ut|St|Stv|Pi|So|Ne deriving(Show, Eq, Ord, Enum)

-- bodka: zretazenie metod
jePracovnyDen = not.jeVikend
jeVikend den = (den == So) || (den == Ne)

-- # --------------------------------------------------------------------------
-- # Binarny strom
-- # --------------------------------------------------------------------------

-- Bude mat pravy aj lavy list
data BTree a = Tip a | Bin (BTree a) (BTree a) deriving (Show)

-- Uloha: Transformovat do zoznamu
bTreeToList (Tip x) = [x]
bTreeToList (Bin l r) = (bTreeToList l) ++ (bTreeToList r)

strom1 = (Bin (Bin (Tip 1) (Tip 2)) (Bin (Tip 3) (Tip 4)))
strom2 = (Bin (Bin (Tip "aa") (Tip "bb")) (Bin (Tip "cc") (Tip "dd")))

cv3_bstree.hs

-- # --------------------------------------------------------------------------
-- # Binarny vyhladavaci strom
-- # --------------------------------------------------------------------------

data BSTree a = Nil | Bin a (BSTree a) (BSTree a) deriving(Show)

bsTreeInsert x Nil = (Bin x Nil Nil)
bsTreeInsert x (Bin v left right) | x < v  = (Bin v (bsTreeInsert x left) right)
                                  | x > v   = (Bin v left (bsTreeInsert x right))

-- bsTreeFromList
-- Transformuje zoznam na binarny vyhladavaci strom
bsTreeFromList xs = foldr (bsTreeInsert) Nil xs

-- bsTreeDelete
-- Odstranenie
-- Ak je vlavo, tak hladam najvacsiu hodnotu
-- Ak je vpravo, tak hladam najmensiu hodnotu
-- bsTreeDelete x (Bin v left right) = | x == v = 

strom1 = (Bin 5 Nil Nil)
-- (bsTreeDelete )