tree.cpp

实现树的数据结构 用C语言 写的 编译通过

#include<iostream>
#include<Node.h>
#include<Stack.h>
using namespace std;
template <class T>
class BinaryTree
{
	public:
		BinaryTree();
		BinaryTree(BinaryTreeNode<T> *lch,BinaryTreeNode<T> *rch,T item);
		int GetNumber(BinTreeNode<T> *root);
		int Exchange(BinTreeNode<T> *root);
        void  Create(istream& in,BinTreeNode<char> *&BT);
};
 


template <class T>
int BinaryTree<T>::GetNumber(BinTreeNode<T> *root)
{
	if(root!=NULL)
	{
		if (root->lch==NULL&&root->rch==NULL)
			return 1;
		else
			return GetNumber(root->lch)+GetNumber(root->rch);
	}
}
		
template <class T>
int BinaryTree<T>::Exchange(BinTreeNode<T> *root)
{
	if(root!=NULL)
	{
	 BinTreeNode<T> *p;
	 p=root->lch;
	 root->lch=root->rch;
	 root->rch=p;
	}
	Exchange(root->lch);
	Exchange(root->rch);
}



void BinaryTree<T>::create(istream& in,BinTreeNode<char> *&BT)
{stack<BinTreeNode<char> *>s;
BT=NULL;
BinTreeNode<char> *p,*t;int k;
char ch;
in>>ch;
while(ch!=0)
{switch(ch)
{
	case'(':s.Push(p);k=1;break;
	case')':s.Pop(t);break;
	case',':k=2;break;
	default:p=new BinTreeNode(ch);
		if(BT==NULL) BT=p;
		else if(k==1) {
			s.GetTop(t);t->lch=p;
		}
		else{
			s.GetTop(t);
			t->rch=p;
		}
}
in>>ch;
}
};