Caminos maximales en árboles binarios

4 Comentarios

1. Haskell

   data Arbol = H Int | N Arbol Int Arbol deriving Show maxLong :: Int -> Arbol -> Int maxLong x a | esHoja x a = maximum [length xs | xs <- map reverse (caminos a), x == head xs] | otherwise = error "no es hoja" esHoja :: Int -> Arbol -> Bool esHoja x (H n) = x == n esHoja x (N i n d) = esHoja x i || esHoja x d caminos :: Arbol -> [[Int]] caminos (H a) = [[a]] caminos (N i a d) = [a:xs | xs <- caminos i] ++ [a: xs | xs <- caminos d]

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

   data Arbol = H Int | N Arbol Int Arbol              deriving Show   maxLong :: Int -> Arbol -> Int maxLong x a     | esHoja x a = maximum [length xs | xs <- map reverse (caminos a),                                         x == head xs]     | otherwise  = error "no es hoja"         esHoja :: Int -> Arbol -> Bool esHoja x (H n)     = x == n esHoja x (N i n d) = esHoja x i || esHoja x d   caminos :: Arbol -> [[Int]] caminos (H a)     = [[a]] caminos (N i a d) = [a:xs | xs <- caminos i] ++ [a: xs | xs <- caminos d]

   Responder

2. Haskell

   maxLong :: Int -> Arbol -> Int maxLong x a = maximum [length xs| xs<- caminos a, last xs == x] caminos :: Arbol -> [[Int]] caminos (H x) = [[x]] caminos (N a x b) = map (x:) (caminos a) ++ map (x:) (caminos b)

   1 2 3 4 5 6

   maxLong :: Int -> Arbol -> Int maxLong x a = maximum [length xs| xs<- caminos a, last xs == x]   caminos :: Arbol -> [[Int]] caminos (H x) = [[x]] caminos (N a x b) = map (x:) (caminos a) ++ map (x:) (caminos b)

   Responder

3. Haskell

   maxLong :: Int -> Arbol -> Int maxLong x a = maximum [length xs | xs <- ramas a, last xs ==x] ramas :: Arbol -> [[Int]] ramas (H x) = [[x]] ramas (N i x d) = [x:r | r <- ramas i ++ ramas d]

   1 2 3 4 5 6

   maxLong :: Int -> Arbol -> Int maxLong x a = maximum [length xs | xs <- ramas a, last xs ==x]   ramas :: Arbol -> [[Int]]               ramas (H x)     = [[x]] ramas (N i x d) = [x:r | r <- ramas i ++  ramas d]

   Responder

4. Haskell

   maxLong :: Int -> Arbol -> Int maxLong x a = maximum $ map length $ filter (\xs -> last xs == x) (caminos a) where caminos (H x) = [[x]] caminos (N a1 x a2) = map (x:) (caminos a1 ++ caminos a2)

   1 2 3 4

   maxLong :: Int -> Arbol -> Int maxLong x a = maximum $ map length $ filter (\xs -> last xs == x) (caminos a)     where caminos (H x)       = [[x]]           caminos (N a1 x a2) = map (x:) (caminos a1 ++ caminos a2)

   Responder