#include<iostream.h>
#include"BinaryTree.h"

void main(void)
{
	char exit='y';

	while(exit=='Y'||exit=='y')
	{
		cout<<endl<<"*********************DLR遞歸創(chuàng)建一棵整型二叉樹**************************";
		cout<<endl<<"請(qǐng)使用int型結(jié)束符!";
		BinTree<int> bt;
		cout<<endl<<"中序遞歸遍歷 : ";
		bt.rec_InOrder(bt.GetRoot());
		cout<<endl<<"中序非遞歸遍歷 : ";
		bt.InOrder(bt.GetRoot());
		cout<<endl<<"繼續(xù)嗎？ [Y/N] : ";
		cin>>exit;
	}
}