{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fhp-ux.hatenadiary.org%2Fentry%2F20081218%2F1229618262\" title=\"\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0 \u6728\u69cb\u9020 \u518d\u5e30 - \u5909\u66f4\" 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":"\u5909\u66f4","description":"\u30cd\u30c3\u30c8\u306b\u8ee2\u304c\u3063\u3066\u3044\u305f\u3001\u6728\u69cb\u9020\u306e\u30bd\u30fc\u30b9\u3092\u8aad\u3080\u3002 #include <stdio.h> #include <stdlib.h> #define N (15) struct node { int data; struct node* left; struct node* right; }; int init_data[N+1] = {0,4,7,9,13,8,10,22,6,0,0,15,2,29,0,0}; void preorder(struct node* p); void inorder(struct node* p); void arrtorder(struct node* p); voi\u2026","provider_url":"https://hatena.blog","height":"190","blog_url":"https://hp-ux.hatenadiary.org/","author_name":"hp-ux","type":"rich","provider_name":"Hatena Blog","image_url":null,"version":"1.0","url":"https://hp-ux.hatenadiary.org/entry/20081218/1229618262","author_url":"https://blog.hatena.ne.jp/hp-ux/","width":"100%","published":"2008-12-18 01:37:42","title":"\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0 \u6728\u69cb\u9020 \u518d\u5e30","categories":[]}