write_tree.C

Go to the documentation of this file.

 
/*
                          Aleph_w
 
  Data structures & Algorithms
  version 2.0.0b
  https://github.com/lrleon/Aleph-w
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2026 Leandro Rabindranath Leon
 
  Permission is hereby granted, free of charge, to any person obtaining a copy
  of this software and associated documentation files (the "Software"), to deal
  in the Software without restriction, including without limitation the rights
  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  copies of the Software, and to permit persons to whom the Software is
  furnished to do so, subject to the following conditions:
 
  The above copyright notice and this permission notice shall be included in all
  copies or substantial portions of the Software.
 
  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  SOFTWARE.
*/
 
 
# include <iostream>
# include <fstream>
# include <cstdlib>
# include <ctime>
# include <vector>
# include <set>
# include <tclap/CmdLine.h>
# include <aleph.H>
# include <tpl_avl.H>
# include <tpl_rb_tree.H>
# include <tpl_splay_tree.H>
# include <tpl_treap.H>
# include <tpl_rand_tree.H>
# include <tpl_binTree.H>
# include <tpl_binNodeUtils.H>
 
using namespace std;
using namespace Aleph;
 
// =============================================================================
// Helper to generate unique random values
// =============================================================================
 
vector<int> generate_random_values(size_t n, unsigned int seed)
{
  srand(seed);
  vector<int> values;
  values.reserve(n);
  
  set<int> used;  // Standard STL set for uniqueness
  
  while (values.size() < n)
    {
      int val = 1 + rand() % (n * 10);
      if (used.find(val) == used.end())
        {
          used.insert(val);
          values.push_back(val);
        }
    }
  
  return values;
}
 
// =============================================================================
// Output stream pointer for print functions
// =============================================================================
 
static ofstream* current_output = nullptr;
 
// =============================================================================
// AVL Tree Writer
// =============================================================================
 
static void avl_print_key(Avl_Tree<int>::Node* p, int, int)
{
  *current_output << p->get_key() << " ";
}
 
void write_avl(const vector<int>& values, const string& prefix)
{
  using Node = Avl_Tree<int>::Node;
  
  ofstream output(prefix + "avl.Tree", ios::out);
  if (!output.is_open())
    {
      cerr << "Error: cannot open " << prefix << "avl.Tree" << endl;
      return;
    }
  
  Avl_Tree<int> tree;
  
  for (int val : values)
    {
      if (tree.search(val) == nullptr)
        {
          Node* node = new Node(val);
          (void) tree.insert(node);  // Ignore nodiscard
        }
    }
  
  current_output = &output;
  int count = preOrderRec(tree.getRoot(), avl_print_key);
  output << endl;
  
  cout << "  Height: " << computeHeightRec(tree.getRoot()) 
       << ", Nodes: " << count << endl;
  cout << "  Written: " << prefix << "avl.Tree" << endl;
  
  destroyRec(tree.getRoot());
}
 
// =============================================================================
// Red-Black Tree Writer (with color info)
// =============================================================================
 
static void rb_print_key(Rb_Tree<int>::Node* p, int, int)
{
  *current_output << p->get_key() << " ";
}
 
static int rb_pos = 0;
static void rb_write_colors(Rb_Tree<int>::Node* p, int, int)
{
  if (COLOR(p) == RED)
    *current_output << rb_pos << " ";
  rb_pos++;
}
 
void write_rb(const vector<int>& values, const string& prefix)
{
  using Node = Rb_Tree<int>::Node;
  
  ofstream output(prefix + "rb.Tree", ios::out);
  if (!output.is_open())
    {
      cerr << "Error: cannot open " << prefix << "rb.Tree" << endl;
      return;
    }
  
  Rb_Tree<int> tree;
  
  for (int val : values)
    {
      if (tree.search(val) == nullptr)
        {
          Node* node = new Node(val);
          tree.insert(node);
        }
    }
  
  current_output = &output;
  
  // Write keys in preorder
  int count = preOrderRec(tree.getRoot(), rb_print_key);
  
  // Write red node positions for visualization
  output << endl << "START-SHADOW ";
  rb_pos = 0;
  inOrderRec(tree.getRoot(), rb_write_colors);
  output << endl;
  
  cout << "  Height: " << computeHeightRec(tree.getRoot()) 
       << ", Nodes: " << count << endl;
  cout << "  Written: " << prefix << "rb.Tree (with color info)" << endl;
  
  destroyRec(tree.getRoot());
}
 
// =============================================================================
// Splay Tree Writer
// =============================================================================
 
static void splay_print_key(Splay_Tree<int>::Node* p, int, int)
{
  *current_output << p->get_key() << " ";
}
 
void write_splay(const vector<int>& values, const string& prefix)
{
  using Node = Splay_Tree<int>::Node;
  
  ofstream output(prefix + "splay.Tree", ios::out);
  if (!output.is_open())
    {
      cerr << "Error: cannot open " << prefix << "splay.Tree" << endl;
      return;
    }
  
  Splay_Tree<int> tree;
  
  for (int val : values)
    {
      if (tree.search(val) == nullptr)
        {
          Node* node = new Node(val);
          tree.insert(node);
        }
    }
  
  current_output = &output;
  int count = preOrderRec(tree.getRoot(), splay_print_key);
  output << endl;
  
  cout << "  Height: " << computeHeightRec(tree.getRoot()) 
       << ", Nodes: " << count << endl;
  cout << "  Written: " << prefix << "splay.Tree" << endl;
  
  destroyRec(tree.getRoot());
}
 
// =============================================================================
// Treap Writer
// =============================================================================
 
static void treap_print_key(Treap<int>::Node* p, int, int)
{
  *current_output << p->get_key() << " ";
}
 
void write_treap(const vector<int>& values, const string& prefix)
{
  using Node = Treap<int>::Node;
  
  ofstream output(prefix + "treap.Tree", ios::out);
  if (!output.is_open())
    {
      cerr << "Error: cannot open " << prefix << "treap.Tree" << endl;
      return;
    }
  
  Treap<int> tree;
  
  for (int val : values)
    {
      if (tree.search(val) == nullptr)
        {
          Node* node = new Node(val);
          tree.insert(node);
        }
    }
  
  current_output = &output;
  int count = preOrderRec(tree.getRoot(), treap_print_key);
  output << endl;
  
  cout << "  Height: " << computeHeightRec(tree.getRoot()) 
       << ", Nodes: " << count << endl;
  cout << "  Written: " << prefix << "treap.Tree" << endl;
  
  destroyRec(tree.getRoot());
}
 
// =============================================================================
// Rand Tree Writer
// =============================================================================
 
static void rand_print_key(Rand_Tree<int>::Node* p, int, int)
{
  *current_output << p->get_key() << " ";
}
 
void write_rand(const vector<int>& values, const string& prefix)
{
  using Node = Rand_Tree<int>::Node;
  
  ofstream output(prefix + "rand.Tree", ios::out);
  if (!output.is_open())
    {
      cerr << "Error: cannot open " << prefix << "rand.Tree" << endl;
      return;
    }
  
  Rand_Tree<int> tree;
  
  for (int val : values)
    {
      if (tree.search(val) == nullptr)
        {
          Node* node = new Node(val);
          tree.insert(node);
        }
    }
  
  current_output = &output;
  preOrderRec(tree.getRoot(), rand_print_key);
  output << endl;
  
  cout << "  Height: " << computeHeightRec(tree.getRoot()) 
       << ", Nodes: " << tree.size() << endl;
  cout << "  Written: " << prefix << "rand.Tree" << endl;
  
  destroyRec(tree.getRoot());
}
 
// =============================================================================
// Binary Tree Writer (unbalanced)
// =============================================================================
 
static void bin_print_key(BinTree<int>::Node* p, int, int)
{
  *current_output << p->get_key() << " ";
}
 
void write_bin(const vector<int>& values, const string& prefix)
{
  using Node = BinTree<int>::Node;
  
  ofstream output(prefix + "bin.Tree", ios::out);
  if (!output.is_open())
    {
      cerr << "Error: cannot open " << prefix << "bin.Tree" << endl;
      return;
    }
  
  BinTree<int> tree;
  
  for (int val : values)
    {
      if (tree.search(val) == nullptr)
        {
          Node* node = new Node(val);
          tree.insert(node);
        }
    }
  
  current_output = &output;
  int count = preOrderRec(tree.getRoot(), bin_print_key);
  output << endl;
  
  cout << "  Height: " << computeHeightRec(tree.getRoot()) 
       << ", Nodes: " << count << endl;
  cout << "  Written: " << prefix << "bin.Tree" << endl;
  
  destroyRec(tree.getRoot());
}
 
// =============================================================================
// Main program
// =============================================================================
 
int main(int argc, char* argv[])
{
  try
    {
      TCLAP::CmdLine cmd(
        "Generate tree structure files for visualization.\n"
        "Creates .Tree files with preorder traversal for btreepic.",
        ' ', "1.0");
 
      TCLAP::ValueArg<size_t> nArg("n", "count",
                                    "Number of elements",
                                    false, 30, "size_t");
      cmd.add(nArg);
 
      TCLAP::ValueArg<unsigned int> seedArg("s", "seed",
                                             "Random seed (0 = use time)",
                                             false, 0, "unsigned int");
      cmd.add(seedArg);
 
      vector<string> allowedTypes = {"all", "avl", "rb", "splay", "treap", "rand", "bin"};
      TCLAP::ValuesConstraint<string> typeConstraint(allowedTypes);
      TCLAP::ValueArg<string> typeArg("t", "type",
                                       "Tree type to generate",
                                       false, "all", &typeConstraint);
      cmd.add(typeArg);
 
      TCLAP::ValueArg<string> prefixArg("o", "output",
                                         "Output file prefix",
                                         false, "", "prefix");
      cmd.add(prefixArg);
 
      cmd.parse(argc, argv);
 
      size_t n = nArg.getValue();
      unsigned int seed = seedArg.getValue();
      string type = typeArg.getValue();
      string prefix = prefixArg.getValue();
 
      if (seed == 0)
        seed = time(nullptr);
 
      cout << "=== Tree Structure Generator ===" << endl;
      cout << "Elements: " << n << ", Seed: " << seed << endl;
      cout << "Type: " << type << endl << endl;
 
      // Generate random values
      vector<int> values = generate_random_values(n, seed);
      
      cout << "Generated " << values.size() << " unique values" << endl << endl;
 
      // Generate requested trees
      if (type == "all" || type == "avl")
        {
          cout << "AVL Tree:" << endl;
          write_avl(values, prefix);
        }
 
      if (type == "all" || type == "rb")
        {
          cout << "Red-Black Tree:" << endl;
          write_rb(values, prefix);
        }
 
      if (type == "all" || type == "splay")
        {
          cout << "Splay Tree:" << endl;
          write_splay(values, prefix);
        }
 
      if (type == "all" || type == "treap")
        {
          cout << "Treap:" << endl;
          write_treap(values, prefix);
        }
 
      if (type == "all" || type == "rand")
        {
          cout << "Rand Tree:" << endl;
          write_rand(values, prefix);
        }
 
      if (type == "all" || type == "bin")
        {
          cout << "Binary Tree (unbalanced):" << endl;
          write_bin(values, prefix);
        }
 
      cout << endl << "Done." << endl;
    }
  catch (TCLAP::ArgException& e)
    {
      cerr << "Error: " << e.error() << " for arg " << e.argId() << endl;
      return 1;
    }
 
  return 0;
}