Suma de árboles por niveles

9 Comentarios

1. Haskell

   suma :: Arbol -> Int suma H = 0 suma (N x i d) = x - suma i - suma d

   1 2 3

   suma :: Arbol -> Int suma H = 0 suma (N x i d) = x - suma i - suma d

   Responder

2. Haskell

   suma :: Arbol -> Int suma a = (sum (profundidadesPares a)) - (sum (profundidadesImpares a)) profundidadesPares a = concat [ profundidad x a | x <- [0,2..profundidadT a]] profundidadesImpares a = concat [profundidad x a | x <-[1,3..profundidadT a]] profundidad _ H = [] profundidad 0 (N a _ _) = [a] profundidad n (N a i d) = (profundidad (n-1) i) ++ (profundidad (n-1) d) profundidadT H = 0 profundidadT (N a i d) = max (1+profundidadT i) (1+profundidadT d)

   1 2 3 4 5 6 7 8 9 10 11 12

   suma :: Arbol -> Int suma a = (sum (profundidadesPares a)) - (sum (profundidadesImpares a))   profundidadesPares a = concat [ profundidad x a | x <- [0,2..profundidadT a]] profundidadesImpares a = concat [profundidad x a | x <-[1,3..profundidadT a]]   profundidad _ H = [] profundidad 0 (N a _ _) = [a] profundidad n (N a i d) = (profundidad (n-1) i) ++ (profundidad (n-1) d)   profundidadT H = 0 profundidadT (N a i d) = max (1+profundidadT i) (1+profundidadT d)

   Responder

3. Haskell

   data Arbol = H | N Int Arbol Arbol ej1 = N 3 (N 2 (N 1 H H) (N 3 H H)) (N 4 H (N 5 H H)) caminosDesdeRaiz :: Arbol -> [[Int]] caminosDesdeRaiz H = [] caminosDesdeRaiz (N x i d) = [x] : [x:ys | ys <- caminosDesdeRaiz i ++ caminosDesdeRaiz d] suma a = sum (aux (caminosDesdeRaiz a)) aux [] = [] aux (xs:xss) | odd (length xs) = last xs: aux xss | otherwise = (-1*last xs) :aux xss

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

   data Arbol = H            | N Int Arbol Arbol              ej1 = N 3 (N 2 (N 1 H H) (N 3 H H)) (N 4 H (N 5 H H))   caminosDesdeRaiz :: Arbol -> [[Int]] caminosDesdeRaiz H = [] caminosDesdeRaiz (N x i d) =   [x] : [x:ys | ys <- caminosDesdeRaiz i ++ caminosDesdeRaiz d] suma a = sum (aux (caminosDesdeRaiz a))   aux [] = [] aux (xs:xss) | odd (length xs)  = last xs: aux xss              | otherwise = (-1*last xs) :aux xss

   Responder

4. data Arbol = H | N Int Arbol Arbol suma :: Arbol -> Int suma (N a b c) = aux (N a b c) 0 where aux H _ = 0 aux (N x i d) n | even n = x + aux i (n+1) + aux d (n+1) | otherwise = -x + aux i (n+1) + aux d (n+1)

   1 2 3 4 5 6 7 8 9

   data Arbol = H            | N Int Arbol Arbol              suma :: Arbol -> Int suma (N a b c) = aux (N a b c) 0    where      aux H _ = 0      aux (N x i d) n | even n = x + aux i (n+1) + aux d (n+1)                      | otherwise = -x + aux i (n+1) + aux d (n+1)

   Responder

5. Haskell

   suma :: Arbol -> Int suma = aux (cycle [1,-1]) where aux xs H = 0 aux (x:xs) (N a b c) = x*a + aux xs b + aux xs c

   1 2 3 4

   suma :: Arbol -> Int suma  = aux (cycle [1,-1])       where aux xs H = 0             aux (x:xs) (N a b c) = x*a + aux xs b + aux xs c

   Responder

6. Haskell

   suma :: Arbol -> Int suma H = 0 suma (N x i d) = x + resta i + resta d resta :: Arbol -> Int resta H = 0 resta (N x i d) = -x + suma i + suma d

   1 2 3 4 5 6 7 8

   suma :: Arbol -> Int suma H = 0 suma (N x i d) = x + resta i + resta d     resta :: Arbol -> Int resta H = 0 resta (N x i d) = -x + suma i + suma d

   Responder

7. Haskell

   suma :: Arbol -> Int suma a = aux a 0 where aux H _ = 0 aux (N x i d) n | n == 0 = x + (aux i 1) + (aux d 1) | otherwise = (-x) + (aux i 0) + (aux d 0)

   1 2 3 4 5

   suma :: Arbol -> Int suma a = aux a 0     where   aux H _ = 0         aux (N x i d) n | n == 0 = x + (aux i 1) + (aux d 1)                 | otherwise = (-x) + (aux i 0) + (aux d 0)

   Responder

8. Haskell

   suma :: Arbol -> Int suma = aux 0 where aux _ H = 0 aux n (N a i d) | even n = a + aux (n+1) i + aux (n+1) d | otherwise = (-a) + aux (n+1) i + aux (n+1) d

   1 2 3 4 5

   suma :: Arbol -> Int suma = aux 0      where aux _ H = 0            aux n (N a i d) | even n    = a + aux (n+1) i + aux (n+1) d                            | otherwise = (-a) + aux (n+1) i + aux (n+1) d

   Responder

9. Haskell

   data Arbol a = H | N a (Arbol a) (Arbol a) deriving (Show, Eq) distanciador :: Arbol Int -> Arbol (Int,Int) distanciador a = aux 0 a where aux n H = H aux n (N x i d) = N (x,n) (aux (n+1) i) (aux (n+1) d) arbol2Lista :: Arbol a -> [a] arbol2Lista H = [] arbol2Lista (N n i d) = n : (arbol2Lista i ++ arbol2Lista d) suma :: Arbol Int -> Int suma a = (sum [k | (k,n) <- cs, even n]) - (sum [k | (k,n) <- cs, odd n]) where cs = arbol2Lista (distanciador a)

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

   data Arbol a   = H | N a (Arbol a) (Arbol a)                 deriving (Show, Eq)   distanciador :: Arbol Int -> Arbol (Int,Int) distanciador a = aux 0 a   where aux n H         = H         aux n (N x i d) = N (x,n) (aux (n+1) i) (aux (n+1) d)   arbol2Lista :: Arbol a -> [a] arbol2Lista H         = [] arbol2Lista (N n i d) = n : (arbol2Lista i ++ arbol2Lista d)   suma :: Arbol Int -> Int suma a = (sum [k | (k,n) <- cs, even n]) - (sum [k | (k,n) <- cs, odd n])   where cs = arbol2Lista (distanciador a)

   Responder