2013数据结构作业3-树与二叉树-参考答案(2)

printf(\二叉树的先序序列：\ PreOrderTraverse(T); printf(\二叉树为：\\n\ DispBiTree(T,0);

printf(\交换结点的左右孩子\\n\ ExchangeBT(T);

printf(\此时二叉树为：\\n\ DispBiTree(T,0);

printf(\输入要统计叶子结点个数的子树的根：\ fflush(stdin);

scanf(\

SubT=SearchTree(T,Subch);

//countl=LeafCount1(SubT); LeafCount2(SubT, countl);

printf(\叶子结点数为：%d\\n\}