bst_main.cpp

来自「这是本人精心搜集的关于常用图论算法的一套源码」· C++ 代码 · 共 37 行

#include "bst.h"
#include <fstream.h>

void visit(Record &x)
 { cout<<x; }

void main(void)
{ Search_tree<Record> b;   int x;
  ifstream inFile("BST.IN");
  inFile>>x;
  while(x!=-999)
   { b.insert(x); inFile>>x; } inFile.close();
  cout<<"Binary_tree B Recursive PreOrder is\t";
  b.preorder(visit); cout<<endl;
  cout<<"Binary_tree B Recursive InOrder is\t";
  b.inorder(visit); cout<<endl;  
  bool stop;
  do
   { char choice;  stop=false; 
     cout<<"\n Presst char( q--exit, i--Insert, d--Remove ) "; 
     cin>>choice; 
     switch (choice)
      { case 'q': stop=true;  break;
        case 'i': 
          cout<<"\ninput Insert Node value ";  cin>>x;
          b.insert(x);  
          break;
        case 'd':  
          cout<<"\ninput Remove Node value ";  cin>>x;
          b.remove(x); 
      }
    }while(!stop);  
  cout<<"\n Inorder After Remove node "<<x<<" of A is\t";
  b.inorder(visit); cout<<endl;
  cout<<"\nPreorder After Remove node "<<x<<" of A is\t"; 
  b.preorder(visit); cout<<endl;
}