BST_Tree.cpp

#include "BST_Tree.h"
#include "Hashtable.h"

BST_Tree::BST_Tree()
{
    
}

void BST_Tree::add_Account(string name, string address, int accountno, int password, int balance)
{
    h.add(accountno, password);
    ofstream write;
    write.open("server.txt", ios::app);
    write << name << endl << address << endl << accountno << endl << password << endl << balance << endl;
    write.close();
    BST_Node * temp = new BST_Node(name, address, accountno, password, balance);

    BST_Node * current = Root;
    if (Root == nullptr)
    {
        Root = temp;
    }
    else
    {
        while (true)
        {
            if (accountno < current->account_number)
            {
                if(current->left == nullptr)
                {
                    current->left = temp;
                    break;
                }
                current = current->left;
            }

            if (accountno > current->account_number)
            {
                if(current->right == nullptr)
                {
                    current->right = temp;
                    break;
                }
                current = current->right;
            }
        }
    }
}

BST_Node * BST_Tree::delete_Account(BST_Node * root, int accountno)
{
    if (root == nullptr)
        cout << "It seems that the Tree is empty or You have entered incorrect data!" << endl;
    else if (accountno < root->account_number)
        root->left = delete_Account(root->left, accountno);
    else if (accountno > root->account_number)
        root->right = delete_Account(root->right, accountno);
    else
    {
        if (root->left && root->right)
        {
            findMax(root->left);
            root->account_number = v.back();
            root->left = delete_Account(root->left, root->account_number);
        }
        else
        {
            cout << "aya" << endl;
            BST_Node * temp = root;
            if (root->left == nullptr)
                root = root->right;
            else if (root->right == nullptr)
                root = root->left;
            delete temp;
        }
    }
    return (root);
}

void BST_Tree::withdraw(int accountno, int amount)
{
    load_Server();
    BST_Node * temp = search(Root, accountno);
    temp->balance = temp->balance - amount;
    vector <int> data;
    ifstream read;
    read.open("transaction.txt", ios::app);
    int line = 0;
    while (!read.eof())
    {
        read >> line;
        if (line == accountno)
        {
            data.push_back(line);
            line = (amount *-1);
            data.push_back (line);
            continue;
        }
        data.push_back(line);
    }
    read.close();

    ofstream write;
    write.open("temp.txt", ios::app);
    for (int i = 0; i < data.size(); i++)
    {
        write << data[i] << endl;
    }
    write.close();
    remove("transaction.txt");
    rename("temp.txt", "transaction.txt");

    update_server(Root);
} 

void BST_Tree::deposit(int accountno,int amount)
{
	load_Server();
	BST_Node *temp = search(Root, accountno);
	temp->balance = temp->balance + amount;

	vector <int> data;
	ifstream read;
	read.open("transaction.txt", ios::app);
	int line = 0;
	while (!read.eof())
	{
		read >> line;
		if (line == accountno)
		{
			data.push_back(line);
			line = amount;
			data.push_back(line);
			continue;
		}
		data.push_back(line);
	}
	read.close();
    
	ofstream write;
	write.open("temp.txt", ios::app);
	for (int i = 0; i < data.size(); i++)
	{
		write << data[i] << endl;
	}
	write.close();
	remove("transaction.txt");
	rename("temp.txt", "transaction.txt");

	update_server(Root);
}

void BST_Tree::editaccount_byAdmin()
{

}

void BST_Tree::transfer(int sender_accountno,int reciever_accountno,int sender_amount)
{
    // happening in tree
	BST_Node *sender = search(Root, sender_accountno);
	sender->balance = sender->balance - sender_amount;
	BST_Node *reciever = search(Root, reciever_accountno);
	reciever->balance = reciever->balance + sender_amount;
	update_server(Root);

	// Now happening in the transacton file

	//for sender
	vector <int> data;
	ifstream read;
	read.open("transaction.txt", ios::app);
	int line = 0;
	while (!read.eof())
	{
		read >> line;
		if (line == sender_accountno)
		{
			data.push_back(line);
			line = (sender_amount*-1);
			data.push_back(line);
			continue;
		}
		data.push_back(line);
	}
	read.close();
    
	ofstream write;
	write.open("temp.txt", ios::app);
	for (int i = 0; i < data.size(); i++)
	{
		write << data[i] << endl;
	}
	write.close();
	remove("transaction.txt");
	rename("temp.txt", "transaction.txt");

	//  for reciever 
	vector <int> data;
	ifstream read;
	read.open("transaction.txt", ios::app);
	int line = 0;
	while (!read.eof())
    {
		read >> line;
		if (line == reciever_accountno)
		{
			data.push_back(line);
			line = sender_amount;
			data.push_back(line);
			continue;
		}
		data.push_back(line);
	}
	read.close();

	ofstream write;
	write.open("temp.txt", ios::app);
	for (int i = 0; i < data.size(); i++)
	{
		write << data[i] << endl;
	}
	write.close();
	remove("transaction.txt");
	rename("temp.txt", "transaction.txt");
}

void BST_Tree::transaction_history()
{

}

void BST_Tree::findMax(BST_Node* Root)
{
    if(Root)
    {
        findMax(Root->left);
        v.push_back(Root->account_number);
        findMax(Root->right);
    }
}

void BST_Tree::load_Server()
{
    ifstream read;
	read.open("server.txt", ios::app);

	string name = "";
	string address = "";
	int accountno = 0;
	int password = 0;
	int balance = 0;
	//cin.ignore();
	while (!read.eof())
	{
		getline(read, name);
		getline(read, address);
		read >> accountno;
		read >> password;
		read >> balance;
		read.ignore();
		read.ignore();
        /*
        cout << name << endl;
		cout << adress << endl;
		cout << accountno << endl;
		cout << password << endl;
		cout << balance << endl;
		*/

		if (name!="" && adress != "" && accountno != 0 && password != 0 )
		{
			//cout << "Enter " << endl;
			BST_Node * temp = new BST_Node(name, address, accountno, password, balance);
			BST_Node * current = Root;
			if (Root == nullptr)
			{
				Root = temp;
			}
			else
            {
				while (true)
				{

					if (accountno < current->account_number)
					{
						if (current->left == nullptr)
						{
							current->left = temp;
							break;
						}
						current = current->left;
					}

					if (accountno > current->account_number)
					{
						if (current->right == nullptr)
						{
							current->right = temp;
							break;
						}
						current = current->right;
					}
					if (accountno == current->account_number)
					{
						break;
					}
				}
			}
		}
	}
	read.close();
}

void BST_Tree::update_server(BST_Node *Root)
{
    static int i = 0;
    if (i == 0)
    {
        i++;
        remove("server.txt");
    }
    ofstream write;
    write.open("server.txt");
	if (Root)
	{
		update_server(Root->left);
		write << Root->name <<endl;
		write << Root->address <<endl;
		write << Root->account_number <<endl;
		write << Root->password <<endl;
		write << Root->balance <<endl;
		update_server(Root->right);
	}
	write.close();	
}

BST_Node* BST_Tree:: search (BST_Node* Root, int accountno)
{
	if (Root == nullptr)
		return (nullptr);

	else if (accountno < Root->account_number)
		return (search(Root->left, accountno));

	else if (accountno > Root->account_number)
		return (search(Root->right, accountno));
        
	return (Root);

}
void BST_Tree:: printoinfo(BST_Node* Root)
{
	if (Root)
	{
		printoinfo(Root->left);
		cout << Root->name << endl;
		cout << Root->address <<endl;
		cout << Root->account_number <<endl;
		cout << Root->password <<endl;
		cout << Root->balance <<endl;
		printoinfo(Root->right);
	}
}