test_avl.cpp

数据结构课程程序

#include <iostream>
#include "AVLtree.hpp"
#include <string>

int main() {
  AVLtree<int> i;
  i.add_item(1);
  i.add_item(3);
  i.add_item(2);
  cout << "Preorder "; i.preorder(); cout << endl;
  cout << "Inorder "; i.inorder(); cout << endl;
  cout << "Postorder "; i.postorder(); cout << endl;
  cout << "Size = " << i.size() << endl << endl;

  AVLtree<int> j(i);
  j.add_item(4);
  cout << "Preorder "; j.preorder(); cout << endl;
  cout << "Inorder "; j.inorder(); cout << endl;
  cout << "Postorder "; j.postorder(); cout << endl;
  cout << "Size = " << j.size() << endl << endl;

  i = j;
  cout << "Preorder "; i.preorder(); cout << endl;
  cout << "Inorder "; i.inorder(); cout << endl;
  cout << "Postorder "; i.postorder(); cout << endl;
  cout << "Size = " << i.size() << endl << endl;

  int n;
  cout << "Type anything to continue" << endl;
  cin >> n;

  AVLtree<string> a;
  a.add_item("ab");
  a.add_item("ba");
  a.add_item("aba");
  cout << "Preorder "; a.preorder(); cout << endl;
  cout << "Inorder "; a.inorder(); cout << endl;
  cout << "Postorder "; a.postorder(); cout << endl;
  cout << "Size = " << a.size() << endl << endl;

  string s[] = {"ab", "ba", "aba", "bab", "b", "house", "ABA"};
  for (int i = 0; i < 7; i++) {
    cout << "Searching " << s[i] << " -> ";
    if (a.search(s[i])) {
      cout << "FOUND" << endl;
    } else {
      cout << "NOT FOUND" << endl;
    }
  }

  return 0;
}