信管117118李志荣数据结构实验五

#include<iostream>
#include"head.h"
using namespace std;
int main()
{
	Binary<char> Tree;
	cout << "The PreOrder:" << endl;
	Tree.PreOrder();
	cout << "\nThe InOrder:" << endl;
	Tree.InOrder();
	cout << "\nThe PostOrder" << endl;
	Tree.PostOrder();
	cout << endl;
	Tree.PrintAll();
	Tree.PrintLeaf();
	return 0;
}

#include<iostream>
using namespace std;
template<typename DataType>
struct Node
{
	DataType data;
	Node *lchild, *rchild,*parent;
};
template<typename DataType>
class Binary
{
	private:
	Node<DataType> *root;
	Node<DataType>* Creat(Node<DataType> *bt, Node<DataType> *par) 
	{
		cout << "enter a data(# to quit): ";
		DataType ch;
		cin >> ch;
		if (ch == '#') bt = NULL;
		else
		{
			bt = new Node<DataType>;
			bt->data = ch;
			bt->parent = par;
			bt->lchild = Creat(bt->lchild, bt);
			bt->rchild = Creat(bt->rchild, bt);
		}
		return bt;
	}
	void Release(Node<DataType> *bt)
	{
		if (bt != NULL)
		{
			Release(bt->lchild);
			Release(bt->rchild);
			delete bt;
		}
	}
	void PreOrder(Node<DataType> *bt)
	{
		if (bt == NULL) return;		
		cout << bt->data << "  ";
		PreOrder(bt->lchild);
		PreOrder(bt->rchild);

	}
	void InOrder(Node<DataType> *bt)
	{
		if (bt == NULL) return;		
		PreOrder(bt->lchild);
		cout << bt->data << "  ";
		PreOrder(bt->rchild);
	
	}
	void PostOrder(Node<DataType> *bt)
	{
		if (bt == NULL) return;
		PreOrder(bt->lchild);
		PreOrder(bt->rchild);
		cout << bt->data << "  ";
		
	}
	void PrintAll(Node<DataType> *bt)
	{
		if (bt == NULL)return;
		cout << "the data:" << bt->data << "   ";
		if (bt->parent != NULL)
			cout << "the parent:" << bt->parent->data << "   ";
		else
			cout << "the parent is:NULL" << "   ";
		if (bt->lchild != NULL)
			cout << "the lchild:" << bt->lchild->data << "   ";
		else
			cout << "the lchild is:NULL" << "   ";
		if (bt->rchild != NULL)
			cout << "the rchild:" << bt->rchild->data << "   ";
		else
			cout << "the rchild is:NULL" << "   ";
		cout << endl;
		PrintAll(bt->lchild);
		PrintAll(bt->rchild);

	}
	void PrintLeaf(Node<DataType> *bt)
	{
		if (bt == NULL) return;
		if (bt->lchild == NULL&&bt->rchild == NULL)
		{
			cout << "the leaf:" << bt->data << endl;
		}
		PrintLeaf(bt->lchild);
		PrintLeaf(bt->rchild);
	}
public:
	Binary() { root = Creat(root, NULL); }
	~Binary() { Release(root); }
	void PreOrder() { PreOrder(root); }
	void InOrder() { InOrder(root); }
	void PostOrder() { PostOrder(root); }
	void PrintAll() { PrintAll(root); }
	void PrintLeaf() { PrintLeaf(root); }
};

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值