{"id":3674,"date":"2018-01-29T06:00:22","date_gmt":"2018-01-29T04:00:22","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=3674"},"modified":"2018-02-05T08:23:46","modified_gmt":"2018-02-05T06:23:46","slug":"maxima-distancia-en-arbol","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/maxima-distancia-en-arbol\/","title":{"rendered":"M\u00e1xima distancia en \u00e1rbol"},"content":{"rendered":"

Los \u00e1rboles binarios con valores en las hojas y en los nodos se definen por<\/p>\n

\n   data Arbol a = H a\n                | N a (Arbol a) (Arbol a) \n     deriving (Eq, Show)\n<\/pre>\n
Por ejemplo, el \u00e1rbol<\/p>\n
\n         10\n        \/  \\\n       \/    \\\n      8      1\n     \/ \\    \/ \\\n    3   9  2   6\n<\/pre>\n
se puede representar por<\/p>\n
\n   ejArbol :: Arbol Int\n   ejArbol = N 10 (N 8 (H 3) (H 9))\n                  (N 1 (H 2) (H 6))\n<\/pre>\n
La distancia entre un padre y un hijo en el \u00e1rbol es el valor absoluto de la diferencia de sus valores. Por ejemplo, la distancia de 10 a 8 es 2 y de 1 a 6 es 5.<\/p>\n
Definir la funci\u00f3n<\/p>\n
\n   maximaDistancia :: (Num a, Ord a) => Arbol a -> a\n<\/pre>\n
tal que (maximaDistancia a) es la m\u00e1xima distancia entre un padre y un hijo del \u00e1rbol a. Por ejemplo,<\/p>\n
\n   maximaDistancia ejArbol                                     ==  9\n   maximaDistancia (N 1 (N 8 (H 3) (H 9)) (N 1  (H 2) (H 6)))  ==  7\n   maximaDistancia (N 8 (N 8 (H 3) (H 9)) (N 10 (H 2) (H 6)))  ==  8\n<\/pre>\n
Soluciones<\/h4>\n
[schedule expon=’2018-02-05′ expat=\u00bb06:00″]<\/p>\n
    \n
  • Las soluciones se pueden escribir en los comentarios hasta el 05 de febrero.\n
  • El c\u00f3digo se debe escribir entre una l\u00ednea con <pre lang=\u00bbhaskell\u00bb> y otra con <\/pre>\n<\/ul>\n
    [\/schedule]<\/p>\n
    [schedule on=’2018-02-05′ at=\u00bb06:00″]<\/p>\n
    \r\ndata Arbol a = H a\r\n             | N a (Arbol a) (Arbol a)\r\n  deriving Show\r\n\r\nejArbol :: Arbol Int\r\nejArbol = N 10 (N 8 (H 3) (H 9))\r\n               (N 1 (H 2) (H 6))\r\n\r\n\r\nmaximaDistancia :: (Num a, Ord a) => Arbol a -> a\r\nmaximaDistancia (H _)     = 0\r\nmaximaDistancia (N x i d) = maximum [abs (x - raiz i)\r\n                                    , maximaDistancia i\r\n                                    , abs (x - raiz d)\r\n                                    , maximaDistancia d]\r\n                             \r\nraiz :: Arbol a -> a\r\nraiz (H x)     = x\r\nraiz (N x _ _) = x\r\n<\/pre>\n
    [\/schedule]<\/p>\n","protected":false},"excerpt":{"rendered":"
    Los \u00e1rboles binarios con valores en las hojas y en los nodos se definen por data Arbol a = H a | N a (Arbol a) (Arbol a) deriving (Eq, Show) Por ejemplo, el \u00e1rbol 10 \/ \\ \/ \\ 8 1 \/ \\ \/ \\ 3 9 2 6 se puede representar por ejArbol…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[5],"tags":[130,269,6],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3674"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/comments?post=3674"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3674\/revisions"}],"predecessor-version":[{"id":3675,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3674\/revisions\/3675"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=3674"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=3674"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=3674"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}