{"categories":[],"version":"1.0","description":"isort.h #ifndef BTREEH #define BTREEH // binary tree class class Btree { public: // insert a pointer associated with a key into the list class BtNode *Insert(int key, void *iptr); // delete a node class BtNode *Delete(class BtNode *bt); // total number of nodes int NData(); // init list class Btree(\u2026","height":"190","image_url":null,"provider_name":"Hatena Blog","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fita.hatenadiary.jp%2Fentry%2F00010420%2Fp3\" title=\" isort.h isort.cc - ita\u2019s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_name":"ita","width":"100%","type":"rich","author_url":"https://blog.hatena.ne.jp/ita/","blog_title":"ita\u2019s diary","blog_url":"https://ita.hatenadiary.jp/","url":"https://ita.hatenadiary.jp/entry/00010420/p3","published":"0001-04-20 00:00:02","title":" isort.h isort.cc"}