btree_main_f.cpp

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

#include <iostream.h>
#include <fstream.h>
#include "b_tree.h"

void visit(char &ch)
{ cout<<ch<<' '; }

void main(void)
{ ifstream inFile("B_tree.in");
  B_tree<char,5> bt;  char k; Error_code result=success;
  inFile>>k;
  while(result==success && k!='0')
    { result=bt.insert(k);    inFile>>k; }
  while(inFile.get() != '\n');        //ignore user's enter key
  cout<<"\n\n B tree inorder is: ";
  bt.inorder(visit);
  cout<<"\nB tree preorder is:\n";
  bt.preorder(visit);  
  for(int i=0; i<4; i++)
   { inFile>>k;  
     result=bt.remove(k);
     if(result!=success)
       { cout<<"Error: "<<result<<endl;
         return;
       }
      else
       { cout<<"\n\n Remove "<<k<<"  Now B tree inorder is: ";
         bt.inorder(visit);
         cout<<"\nB tree preorder is:\n";
         bt.preorder(visit);  
         while(cin.get()!= '\n');
       }  
   }   
  cout<<endl;  inFile.close();
}