实验三1.cpp

来自「希尔排序算法的实现C++sdvzvaGedgvfsewfcAWfqawfaswf」· C++ 代码 · 共 12 行

#include <iostream.h>
#include "实验三基础1.h"
void main(){
bintree<int> B(0);
cout<<"顺序输入树结点的值:";
B.CreateBinTree(B.root);
cout<<"前序输入的二叉树顺序输出为：";
B.inorder(B.root);
cout<<endl;
int c=B.size(B.root);
cout<<"输入二叉树的接点数目为："<<c<<endl;
}