writeAvl.C

Go to the documentation of this file.

 
/* Aleph-w
 
     / \  | | ___ _ __ | |__      __      __
    / _ \ | |/ _ \ '_ \| '_ \ ____\ \ /\ / / Data structures & Algorithms
   / ___ \| |  __/ |_) | | | |_____\ V  V /  version 1.9c
  /_/   \_\_|\___| .__/|_| |_|      \_/\_/   https://github.com/lrleon/Aleph-w
                 |_|         
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2018 Leandro Rabindranath Leon 
 
  This program is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
 
  This program is distributed in the hope that it will be useful, but
  WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  General Public License for more details.
 
  You should have received a copy of the GNU General Public License
  along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
 
# include <cstdlib>
# include <ctime>
# include <iostream>
# include <fstream>
# include <string>
# include <aleph.H>
# include <tpl_avl.H>
# include <tpl_binNodeUtils.H>
 
# include <cassert>
using namespace std;
# include <cassert>
using namespace Aleph;
 
ofstream file("avl-tree-aux.Tree", ios::out); 
 
 
static void print_key(Avl_Tree<int>::Node *p, int, int) 
{
  file << p->get_key() << " ";
}
 
 
int main(int argc, char *argv[])
{
  int n = 1000;
  if (argc > 1)
    {
      try { n = stoi(argv[1]); } catch (...) { n = 1000; }
    }
 
  if (n <= 0)
    {
      cerr << "n must be positive" << endl;
      return 1;
    }
 
  unsigned int t = std::time(0);
  if (argc > 2)
    {
      try { t = stoul(argv[2]); } catch (...) { t = std::time(0); }
    }
 
  srand(t);
 
  cout << "writeAvl " << n << " " << t << endl;
 
  Avl_Tree<int> tree;
  Avl_Tree<int>::Node *node;
  int i, value;
 
  cout << "Inserting " << n << " random values in treee ...\n";
 
  for (i = 0; i < n; i++)
    {
      do
  {
 
    value = (int) (n*10.0*rand()/(RAND_MAX+1.0));
    node = tree.search(value);
  } while (node not_eq NULL);
      node = new Avl_Tree<int>::Node (value);
      tree.insert(node);
    }
  cout << endl << "verifying avl tree after insertions ... " 
       << endl;
  assert(is_avl(tree.getRoot()));
  cout << " done" << endl;
 
  preOrderRec(tree.getRoot(), print_key);
 
  destroyRec(tree.getRoot());
}