二叉树的链式存储结构存储，实现树的构造

#include<iostream> using namespace std; struct binode {char data; binode *lchild,*rchild; }; class tree { public: tree(){root=creat(root);} ~tree(){release(root);} void preorder() {preorder(root);} vo

>>阅读原文<<