#include "Tree.h"

Tree::Tree()
{
	head = nullptr;
}

void
Tree::preOrder(Node* node)
{
	if (node == nullptr)
		return;
	std::cout << (node->value) << ' ';
	preOrder(node->left);
	preOrder(node->right);
}

void
Tree::inOrder(Node* node)
{
	if (node == nullptr)
		return;
	preOrder(node->left);
	std::cout << (node->value) << ' ';
	preOrder(node->right);
}

void
Tree::postOrder(Node* node)
{
	if (node == nullptr)
		return;
	preOrder(node->left);
	preOrder(node->right);
	std::cout << (node->value) << ' ';
}

void Tree::print(const size_t& sortId)
{
	if (sortId == 1)
		preOrder(head);

	else if (sortId == 2)
		inOrder(head);

	else if (sortId == 3)
		postOrder(head);
	else
		std::cout << "Wrong Sort ID" << std::endl;
}

void
Tree::addMethod(Node*& node, const int& value)
{
	if (node == nullptr)
		node = new Node(value);
	else if (value > node->value)
		addMethod(node->right, value);
	else
		addMethod(node->left, value);
}

void
Tree::deleteMethod(Node* node)
{
	if (node->left != nullptr)
		deleteMethod(node->left);

	if (node->right != nullptr)
		deleteMethod(node->right);
	delete node;
}

void Tree::eraseMethod(const int& value)
{
}

int
Tree::heightMethod(Node* node)
{
	if (node == 0)
		return 0;
	int left, right;
	if (node->left != NULL)
		left = heightMethod(node->left);
	else
		left = -1;
	if (node->right != NULL)
		right = heightMethod(node->right);
	else
		right = -1;
	int max = left > right ? left : right;
	return max + 1;
}

bool Tree::empty()
{
	return head == nullptr;
}

void Tree::clear()
{
	deleteMethod(head);
	head = nullptr;
}

int Tree::height()
{
	return heightMethod(head);
}

void Tree::add(const int& value)
{
	addMethod(head, value);
}