bitreelib.h

数据结构头文件源代码

#include<math.h>
template<class T>
void PrintVTree(BiTreeNode<T>*&t)
{
	int screen Width=64;
	int dataWidth=2;
	linQueue<BiTreeNode<T>*>Q;
	LinQueue<Info>QI;
	BiTreeNode<T>*p;
	Info s,s1,s2;
	int offset,leve=-1,i;
	Q.QInsert(t);
	s.xIndent=screenWidth/dataWidth;
	s.yLevel=0;
	QI.QInsert(s);
	while(!Q.QueueEmpty()&&!QI.QueueEmpty())
	{
		s2=s;
		p=Q.QDelete();
		s=QI.QDelete();
		if(s,yLevel!=level)
		{
			cout<<"\n第"<<s.yLevel<<"层";
			level=s.yLevel;
			for(i=0;i<s.xIndent-1;i++)cout<<"";
		}
		else
			for(i=0;i<s.xIndent-s2.xIndent;i++)cout<<"";
			cout<<p->data;
			if(p->Left()!=NULL)
			{
				Q.QInsert(p->Left()_;
				s1.yLevel=s.syLevel+1;
				offset=screenWidth/pow(dataWidth,s1.yLevel+1);
				s1.xIndent=s.xIndent-offset;
				QI.QInsert(s1);
			}
			if(p->Right()!=NULL)
			{
				Q.QInsert(p->Rnght()_;
				s1.yLevel=s.syLevel+1;
				offset=screenWidth/pow(dataWidth,s1.yLevel+1);
				s1.xIndent=s.xIndent-offset;
				QI.QInsert(s1);
			}
	}
}