//:BinaryTreeMain.cpp
//****************************************************
//Designed by: Xinyun Yu	Date: 2006.4.16
//The main implementation file for ADT BinaryTree
//****************************************************
#include "BinaryTree.h"
#include <iostream>
using namespace std;

#define D(X) cout << #X << endl; X; cout << endl

int main()
{
	try{
		BinaryTree T;
		cout << "Now please input the tree: " << endl;
		cin >> T;
		D(T.prePrintTree());
		D(T.inPrintTree());
		D(T.postPrintTree());
		D(T.levelPrintTree());
		char retry;

		do{
			char m, n;
			char ancester;	
			cout << "Input two characters to find nearest ancester: ";
			cin >> m >> n;

			if(T.findAncester(m, n, ancester))
				cout << "Their ancester: " << ancester << endl;
			else
				cout << "Not find it!" << endl;

			cout << "Retry(y/n)? ";
			cin >> retry;
		}while(retry == 'y' || retry == 'Y'); 
	} catch(TreeException& E){
		cout << E.what() << endl;
		cout << "Program abort!" << endl;
		exit(0);
	}

	cout << "Bye-bye!" << endl;

	return 0;
}///:~