{"width":"100%","provider_url":"https://hatena.blog","type":"rich","published":"2013-06-03 23:34:26","categories":["ocaml","python","memo"],"image_url":"http://ecx.images-amazon.com/images/I/51FBsJHo4EL.jpg","description":"\u300c\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u306e\u57fa\u790e\u300d\u3092\u3061\u3087\u3063\u3068\u305a\u3064\u8aad\u3093\u3067\u30662\u5206\u63a2\u7d22\u6728\u306e\u8d70\u67fb\u304c\u3067\u3066\u304d\u305f\u3093\u3067\u3001python\u3067\u3082\u66f8\u3044\u3066\u307f\u307e\u3057\u305f\u3002ocaml\u3060\u3068\u3053\u3046 type tree_t = Empty | Leaf of int | Node of tree_t * int * tree_t (* \u76ee\u7684 : data\u304c2\u5206\u63a2\u7d22\u6728tree\u306b\u542b\u307e\u308c\u3066\u3044\u308b\u304b\u3092\u8abf\u3079\u308b *) (* search : tree_t -> int -> bool *) let rec search tree data = match tree with Empty -> false | Leaf (n) -> data = n | Node (t1, n\u2026","title":"2\u5206\u63a2\u7d22\u6728","url":"https://y0m0r.hateblo.jp/entry/20130603/1370270066","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fy0m0r.hateblo.jp%2Fentry%2F20130603%2F1370270066\" title=\"2\u5206\u63a2\u7d22\u6728 - \u30e1\u30e2\u7f6e\u304d\u5834\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_title":"\u30e1\u30e2\u7f6e\u304d\u5834","version":"1.0","provider_name":"Hatena Blog","author_name":"yuheiomori0718","height":"190","blog_url":"https://y0m0r.hateblo.jp/","author_url":"https://blog.hatena.ne.jp/yuheiomori0718/"}