#include "ExtendedBinaryTree.h"
#include "ExtendedBinaryTreeNode.h"
#include "Ware.h"
#include <iostream>

int main() {
  Ware ware1("S", 1, 5.12, 10.37, 13.0);
  Ware ware2("L", 2, 6.12, 1.37, 29.0);
  Ware ware3("A", 3, 4.12, 9.37, 10.0);
  Ware ware4("Z", 12, 1.12, 18.37, 19.0);
  Ware ware5("LA", 27, 0.12, 13.37, 17.0);
  Ware ware6("LC", 13, 13.12, 15.37, 16.0);
  Ware ware7("ABC", 4, 7.12, 27.37, 35.0);
  Ware ware8("C", 123, 9.12, 2.37, 4.0);

  ExtendedBinaryTree tree(&ware1);
  tree.insert(&ware2);
  tree.insert(&ware3);
  tree.insert(&ware4);
  tree.insert(&ware5);
  tree.insert(&ware6);
  tree.insert(&ware7);
  tree.insert(&ware8);

  // std::cout << ware1 << std::endl;
  std::cout << tree.printPreorder() << std::endl;
  std::cout << tree.printPostorder() << std::endl;
  std::cout << tree.printInorder();

  return 0;
}