摘要:
#includestruct tree{ int data; tree *left,*right;};class Btree{ static int n; static int m;public: tree *root; Btree() { root=NULL; } void create_Btree(int); void Preorder(tree *); //先序遍历 void inorder(tree *); //中序遍历 void Postorder(tree *); //后序遍历 void display1() {Preorder(root); coutdata=x; newnode 阅读全文