// CSE 330 Lab 6.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include "pch.h"
#include <iostream>
#include "BinarySearchTree.h"

int main()
{
	BinarySearchTree<int> bt1 = BinarySearchTree<int>();
	bt1.insert(6);
	bt1.insert(2);
	bt1.insert(8);
	bt1.insert(1);
	bt1.insert(4);
	bt1.insert(3);
	bt1.printTreePostOrder();
	cout << endl;
	bt1.printTreePreOrder();
	cout << endl;
	cout << bt1.isBalanced() << endl;
	cout << bt1.height() << endl;

	BinarySearchTree<int> bt2 = BinarySearchTree<int>();
	bt2.insert(6);
	bt2.insert(4);
	bt2.insert(2);
	bt2.insert(5);
	bt2.insert(7);
	bt2.insert(8);
	bt2.insert(9);
	bt2.printTreePostOrder();
	cout << endl;
	bt2.printTreePreOrder();
	cout << endl;
	cout << bt2.isBalanced() << endl;
	cout << bt2.height() << endl;

	BinarySearchTree<int> bt3 = BinarySearchTree<int>();
	bt3.insert(7);
	bt3.insert(5);
	bt3.insert(2);
	bt3.insert(6);
	bt3.insert(10);
	bt3.insert(8);
	bt3.insert(12);
	bt3.printTreePostOrder();
	cout << endl;
	bt3.printTreePreOrder();
	cout << endl;
	cout << bt3.isBalanced() << endl;
	cout << bt3.height() << endl;
}