实验四 树和二叉树实验1

#include
const int MaxSize=20;
class tree
{
public:
	tree(char a[],int n);
	void printall();
	void printpc();
	void printle();
private:
	char point[MaxSize];
	int length;
};


tree::tree(char a[],int n)
{
if(n>MaxSize||n<=0)throw"错误";
for(int i=0;i=1)
                cout<<"结点"<length&&point[i-1]!='#')    
            cout<