{"description":"\u6700\u7d42\u7ae0\u300c\u30d7\u30ed\u30b0\u30e9\u30e0\u306e\u8ad6\u8a3c\u300d\u306e\u7df4\u7fd2\u554f\u984c\u3067\u3059\u3002\u3064\u3044\u306b\u6700\u5f8c\u3067\u3059\u3002 9. \u4ee5\u4e0b\u306e\u578b\u304c\u4e0e\u3048\u3089\u308c\u3066\u3044\u308b\u3068\u3059\u308b data Tree = Leaf Int | Node Tree Tree \u3053\u306e\u6728\u306e\u8449\u306e\u500b\u6570\u306f\u3001\u7bc0\u306e\u500b\u6570\u3088\u308a\u3082\u3001\u5e38\u306b1\u591a\u3044\u3053\u3068\u3092\u793a\u3059 \u307e\u305a\u8449\u306e\u500b\u6570\u3092\u6570\u3048\u308b\u95a2\u6570 countLeaf \u3068\u3001\u7bc0\u306e\u500b\u6570\u3092\u6570\u3048\u308b\u95a2\u6570 countNode \u3092\u5b9a\u7fa9\u3059\u308b countLeaf :: Tree -> Int countLeaf (Leaf _) = 1 countLeaf (Node l r) = (countLeaf l) + (contLeaf r) countNode :: Tree -> Int countNo\u2026","type":"rich","provider_url":"https://hatena.blog","author_name":"morning_reading","height":"190","published":"2011-06-15 00:00:00","author_url":"https://blog.hatena.ne.jp/morning_reading/","width":"100%","provider_name":"Hatena Blog","blog_url":"https://morning-reading.hatenadiary.org/","image_url":null,"blog_title":"\u6bce\u671d30\u5206\u8aad\u66f8\u4f1a","version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmorning-reading.hatenadiary.org%2Fentry%2F20110615%2Fp1\" title=\"\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0 Haskell \u7b2c13\u7ae0 \u30d7\u30ed\u30b0\u30e9\u30e0\u306e\u8ad6\u8a3c \u7df4\u7fd2\u554f\u984c \u305d\u306e4 - \u6bce\u671d30\u5206\u8aad\u66f8\u4f1a\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","title":"\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0 Haskell \u7b2c13\u7ae0 \u30d7\u30ed\u30b0\u30e9\u30e0\u306e\u8ad6\u8a3c \u7df4\u7fd2\u554f\u984c \u305d\u306e4","categories":[],"url":"https://morning-reading.hatenadiary.org/entry/20110615/p1"}