7-1.cpp

来自「大学计算机专业课程中数据结构各章的算法设计」· C++ 代码 · 共 31 行

#include"Tree1.h"
void property3(TreeNode1 *p,int &n0,int &n2)
{
	if(p!=NULL)
	{
		if(p->left==NULL&&p->right==NULL)
			n0++;
         if(p->left!=NULL&&p->right!=NULL)
			 n2++;
		 property3(p->left,n0,n2);
		 property3(p->right,n0,n2);
	}
}
void main()
{
char *str="ABD.G...CE..FH...";
cout<<"The  Tree: "<<str<<"\0";
Tree1 t1(str);
t1.preorder();
t1.inorder();
t1.postorder();
int n0=0,n2=0;
property3(t1.root,n0,n2);
cout<<"验证二叉树性质；";
cout<<"n0="<<n0<<", n2="<<n2<<", n0==n2+1 ? ";

if(n0==n2+1)
    cout<<"正确"<<endl;
else
cout<<"错误"<<endl;
}