bstmain.cpp

来自「经典c++程序的实现」· C++ 代码 · 共 66 行

#include <iostream.h>
#include <stdlib.h>
#include <assert.h>

#include "..\include\book.h"

typedef int BELEM;

#include "..\include\bintree.h"

#include "..\include\bst.h"

int main()
{
  BST tree;

  cout << "IsEmpty: " << tree.isEmpty() << "\n";
  tree.insert(10);
  tree.print();
  cout << "IsEmpty: " << tree.isEmpty() << "\n";
  tree.remove(10);
  tree.print();
  cout << "IsEmpty: " << tree.isEmpty() << "\n";
  tree.clear();
  cout << "IsEmpty: " << tree.isEmpty() << "\n";
  tree.insert(15);
  cout << "IsEmpty: " << tree.isEmpty() << "\n";
  tree.find(20);
  tree.find(15);
  tree.print();
  tree.remove(20);
  cout << "Now, insert 20\n";
  tree.insert(20);
  tree.print();
  tree.remove(20);
  tree.print();
  tree.insert(70);
  cout << "IsEmpty: " << tree.isEmpty() << "\n";
  tree.insert(35);
  tree.insert(20);
  tree.insert(17);
  tree.insert(15);
  tree.insert(19);
  tree.insert(100);
  tree.insert(90);
  tree.insert(95);
  tree.insert(1);
  tree.print();
  tree.find(100);
  tree.find(99);
  tree.find(20);
  cout << "Need to do some delete tests.\n";
  tree.remove(15);
  tree.print();
  tree.remove(15);
  tree.print();
  tree.remove(15);
  tree.remove(70);
  tree.print();
  tree.clear();
  tree.print();
  cout << "IsEmpty: " << tree.isEmpty() << "\n";

  return(0);
}