///////////////////////////////////////////////////////////////////////////
// Tree.cpp  -  demonstrates how to define a template m-ary tree class   //
// ver 1.2                                                               //
// Language:    Visual C++, 2008                                         //
// Platform:    Dell Precision T7400, Vista Ultimate, SP1                //
// Application: CSE687 - Demo for Project #1, Spring 2009                //
// Author:      Jim Fawcett, Syracuse University, CST 4-187,             //
//              (315) 443-3948, jfawcett@twcny.rr.com                    //
///////////////////////////////////////////////////////////////////////////

#include <string>
#include "tree.h"

//----< test stub >------------------------------------------------------

#ifdef TEST_TREE

using namespace AbstractDataTypes;

void main()
{
  std::cout << "\n  Tree<T> class demonstration";
  std::cout << "\n =============================\n";

  // Here's how you create a node on the heap
  // MNode<std::string>* pRoot = new MNode<std::string>("root");

  // Creating nodes on main's stack:
  MNode<std::string> root("root");
  MNode<std::string> child1("child1");
  MNode<std::string> child2("child2");
  MNode<std::string> grandchild11("grandchild11");
  MNode<std::string> grandchild21("grandchild21");
  MNode<std::string> grandchild22("grandchild22");
  MNode<std::string> greatgrandchild211("greatgrandchild211");
  MNode<std::string> child3("child3");

  child1.add(&grandchild11);
  grandchild21.add(&greatgrandchild211);
  child2.add(&grandchild21);
  child2.add(&grandchild22);
  root.add(&child1);
  root.add(&child2);
  root.add(&child3);

  class newOper : public Operation<std::string>
  {
  public:
    void operator()(MNode<std::string>* pNode)
    {
      std::cout << "\n -- " << pNode->value();
    }
  };

  Tree<std::string> tree(new newOper);
//  Tree<std::string> tree;
  tree.add(&root);
  tree.add(&child1);
  tree.add(&child2);
  tree.add(&child3);
  tree.add(&grandchild11);
  tree.add(&grandchild21);
  tree.add(&grandchild22);
  tree.add(&greatgrandchild211);

  tree.walk(&root);

  std::cout << "\n\n  removing first child";
  tree.remove(&child1);  // remove from nodes collection
  root.remove(&child1);  // unlink from tree structure

  std::cout << "\n  unmarking all nodes\n";
  tree.clearMarks();

  tree.walk(&root);

  std::cout << "\n\n";
}
#endif