bstree.cpp

二叉排序树的几种操作 包括：建立二叉排序树

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

void main()
{
	BSTree BTree;
    int number;
	int choiceNumber;
    char flag;
	while(1)
	{
		print();   
		cout<<"Choose: ";
		cin>>choiceNumber;
		switch(choiceNumber)
		{
		case 1:   
			  BTree.Display();
			  break;
		case 2:
			  cout<<"Insert: ";
              cin>>number;
              BTree.Insert(number);
              BTree.Display();
			  break;
		case 3:
				cout<<"Find: ";
				cin>>number;   
				if(BTree.Find(number)==NULL)
				{
					cout<<"Not Exist."<<endl;
				}
                else
				{   
                    cout<<"Exist."<<endl;
   
				}
				break;
		case 4:
				cout<<"Delete: ";  
				cin>>number;
				BTree.Delete(number);
                BTree.Display();
				break;
		default: break;
		}

		cout<<"Go On?(Y/N): ";
		cin>>flag;
		if(flag=='N'||flag=='n')
			break;
	}
}