数据结构——树

孩子兄弟表示法

#include <iostream>
using namespace std;
const int Max = 20;

struct TNode
{
	char data;
	TNode *firstchild, *rightsib;
};

class Tree
{
public:
	Tree( );
	~Tree( ){Release(root);}          //析构函数，释放各结点的存储空间
    void PreOrder();
    void PostOrder();
private:
	TNode *root;
	void PreOrder(TNode *bt);
	void PostOrder(TNode *bt);
	void Release(TNode *bt);
};

Tree::Tree( )
{
	TNode *Q[Max] = {NULL};							// 以队列的形式存储树结点
	char ch1 = '#', ch2 = '#';
	int front = -1, rear = -1;						// 初始化时队首指针和队尾指针
	TNode *p = NULL, *q = NULL;
//	cout<<"请输入根结点：";
	cin>>ch1;										// 输入根结点
	p = new TNode; p->data = ch1;
	p->firstchild = p->rightsib = NULL;				// 初始化根结点的孩子兄弟节点
	root = p;
	Q[++rear] = p;									// 根结点入队
    cout<<"请输入结点对，以空格分隔：";				// 以父子结点对的形式从上往下，从左往后的形式输入
	fflush(stdin);									// 清除读写缓冲区
    ch1 = getchar(); getchar(); ch2 = getchar();	// ch1接收结点对的父结点，ch2接收结点对的子结点，中间getchar用于接收空格
	while (ch1 != '#' || ch2 != '#')
	{
		p = new TNode; p->data = ch2;
		p->firstchild = p->rightsib = NULL;
		Q[++rear] = p;
		while (front != rear)
		{
			q = Q[front + 1];						// q存储队首结点
			if(ch1 == q -> data){
                if(q->firstchild == NULL){
                    q->firstchild = p;

                }else{
                    TNode *s = q->firstchild;
                    while(s->rightsib!=NULL){
                        s=s->rightsib;
                    }
                    s->rightsib = p;
                }
                break;
			}else{
                front++;
			}

		}
		cout<<"请输入结点对，以空格分隔：";
		fflush(stdin);
        ch1 = getchar(); getchar(); ch2 = getchar();
	}
}
void Tree::PreOrder(){
    PreOrder(root);
}
void Tree::PostOrder(){
    PostOrder(root);
}
void Tree::PreOrder(TNode *bt){
    if(bt == NULL)
        return;
    cout<<bt->data<<" ";
    PreOrder(bt->firstchild);
    PreOrder(bt->rightsib);
}
void Tree::PostOrder(TNode *bt){
    if(bt == NULL)
        return;
    PostOrder(bt->firstchild);
    cout<<bt->data<<" ";
    PostOrder(bt->rightsib);


}
void Tree::Release(TNode *bt)
{
	if (bt == NULL)  return;
	else
	{
		Release(bt->firstchild);
		Release(bt->rightsib);
		delete bt;
	}
}

int main( )
{
	Tree t1;
	cout<<"前序遍历的结果是：";
	t1.PreOrder();
	cout<<endl;
	cout<<"后序遍历的结果是：";
	t1.PostOrder();
	cout<<endl;
	return 0;
}