bst_main.cpp

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

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

void visit(Record<int> &x)
 { cout<<x.Getkey(); }

void main(void)
{ Search_tree<Record<int>> 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;  
  cout<<"\ninput Search Node val ";  cin>>x;
  b.remove(x);  
  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;
}