Complete Code

Author: SameetAsadullah

src/.vs/Binary-Search-Tree/FileContentIndex/03016873-75d7-495c-a653-ca0604e6c607.vsidx

@@ -0,0 +1,101 @@
+#pragma once
+#include<string>
+#include<iostream>
+using namespace std;
+
+class AccountsRecords {
+	string firstName, lastName;
+	double balance;
+	int recordNo, accID;
+
+public:
+	AccountsRecords() : firstName(""), lastName(""), balance(0), recordNo(0), accID(0) {
+	}
+
+	AccountsRecords(string fN, string lN, double b, int rN, int aID) : firstName(fN), lastName(lN), balance(b), recordNo(rN), accID(aID) {
+	}
+
+	void setFirstName(string fN) {
+		firstName = fN;
+	}
+
+	void setLastName(string lN) {
+		lastName = lN;
+	}
+
+	void setBalance(const double& b) {
+		balance = b;
+	}
+
+	void setRecordNo(const int& rN) {
+		recordNo = rN;
+	}
+
+	void setAccountID(const int& aID) {
+		accID = aID;
+	}
+
+	string getFirstName() const {
+		return firstName;
+	}
+
+	string getLastName() const {
+		return lastName;
+	}
+
+	double getBalance() const {
+		return balance;
+	}
+
+	int getRecordNo() const {
+		return recordNo;
+	}
+
+	int getAccountID() const {
+		return accID;
+	}
+
+	void Display() {
+		cout << "Record Number: " << recordNo << endl;
+		cout << "Account ID: " << accID << endl;
+		cout << "First Name: " << firstName << endl;
+		cout << "Last Name: " << lastName << endl;
+		cout << "Balance: " << balance << endl << endl;
+	}
+
+	AccountsRecords operator=(const AccountsRecords& rhs) {
+		accID = rhs.accID;
+		firstName = rhs.firstName;
+		lastName = rhs.lastName;
+		balance = rhs.balance;
+		recordNo = rhs.recordNo;
+
+		return *this;
+	}
+
+	bool operator<(const AccountsRecords& rhs) const {
+		if (this->accID < rhs.accID) {
+			return true;
+		}
+		return false;
+	}
+
+	bool operator>(const AccountsRecords& rhs) const {
+		if (this->accID > rhs.accID) {
+			return true;
+		}
+		return false;
+	}
+
+	bool operator==(const AccountsRecords& rhs) const {
+		if (this->accID == rhs.accID) {
+			return true;
+		}
+		return false;
+	}
+};
+
+ostream& operator<<(ostream& output, AccountsRecords& rhs) {
+	rhs.Display();
+	return output;
+}

src/.vs/Binary-Search-Tree/FileContentIndex/100d8f65-a640-4001-8fc9-301cabd6ce8c.vsidx

@@ -0,0 +1,210 @@
+#pragma once
+#include<iostream>
+using namespace std;
+
+template<class DT>
+class Node {
+public:
+	DT data;
+	Node* left;
+	Node* right;
+
+	Node() :left(NULL), right(NULL) {
+	}
+};
+
+template<class DT>
+class BSTree {
+	Node<DT>* root;
+
+	Node<DT>* traverseForInserting(Node<DT>* temp, const DT& newDataItem) {
+		if (temp == NULL) {
+			temp = new Node<DT>;
+			temp->data = newDataItem;
+			return temp;
+		}
+
+		else if (newDataItem < temp->data) {
+			temp->left = traverseForInserting(temp->left, newDataItem);
+		}
+
+		else if (newDataItem > temp->data) {
+			temp->right = traverseForInserting(temp->right, newDataItem);
+		}
+
+		else {
+			cout << "Duplicates are present" << endl;
+		}
+		return temp;
+	}
+
+	bool traverseForSearching(Node<DT>* temp, const DT& searchDataItem) {
+		if (temp == NULL) {
+			return false;
+		}
+
+		else if (searchDataItem == temp->data) {
+			return true;
+		}
+
+		else if (searchDataItem < temp->data) {
+			return traverseForSearching(temp->left, searchDataItem);
+		}
+
+		else if (searchDataItem > temp->data) {
+			return traverseForSearching(temp->right, searchDataItem);
+		}
+	}
+
+	int getMax(const int& num1, const int& num2) {
+		if (num1 == num2) {
+			return num1;
+		}
+
+		else if (num1 > num2) {
+			return num1;
+		}
+
+		return num2;
+	}
+
+	int calculateHeight(Node<DT>* temp) {
+		if (temp == NULL) {
+			return -1;
+		}
+		int leftHeight = calculateHeight(temp->left);
+		int rightHeight = calculateHeight(temp->right);
+
+		return getMax(leftHeight, rightHeight) + 1;
+	}
+
+	void deleteNode(Node<DT>*& nodePtr) {
+		Node<DT>* temp;
+
+		if (nodePtr->right == NULL) {
+			temp = nodePtr;
+			nodePtr = nodePtr->left;
+			delete temp;
+		}
+
+		else if (nodePtr->left == NULL) {
+			temp = nodePtr;
+			nodePtr = nodePtr->right;
+			delete temp;
+		}
+
+		else {
+			temp = nodePtr->right;
+
+			while (temp->left != NULL) {
+				temp = temp->left;
+			}
+
+			nodePtr->data = temp->data;
+
+			Node<DT>* prev = nodePtr->right;
+
+			if (prev->left != NULL) {
+
+				while (prev->left != temp) {
+					prev = prev->left;
+				}
+
+				if (temp->right == NULL) {
+					delete temp;
+					prev->left = NULL;
+				}
+
+				else {
+					prev->left = temp->right;
+					delete temp;
+				}
+			}
+
+			else {
+				delete temp;
+				nodePtr->right = NULL;
+			}
+		}
+	}
+
+	bool traverseForRemove(Node<DT>*& temp, const DT& deleteDataItem) {
+		if (temp == NULL) {
+			return false;
+		}
+
+		else if (temp->data == deleteDataItem) {
+			deleteNode(temp);
+		}
+
+		else if (deleteDataItem < temp->data) {
+			return traverseForRemove(temp->left, deleteDataItem);
+		}
+
+		else if (deleteDataItem > temp->data) {
+			return traverseForRemove(temp->right, deleteDataItem);
+		}
+
+	}
+
+public:
+	BSTree() : root(NULL) {
+	}
+
+	Node<DT>* getRoot() {
+		return root;
+	}
+
+	void insert(const DT& newDataItem) {
+		root = traverseForInserting(root, newDataItem);
+	}
+
+	bool retrieve(const DT& searchDataItem) {
+		return traverseForSearching(root, searchDataItem);
+	}
+
+	bool isEmpty() {
+		if (root == NULL) {
+			return true;
+		}
+		return false;
+	}
+
+	int getHeight() {
+		return calculateHeight(root);
+	}
+
+	bool remove(const DT& deleteDataItem) {
+		return traverseForRemove(root, deleteDataItem);
+	}
+
+	void inOrderDisplay(Node<DT>* temp) {
+		if (temp != NULL) {
+			inOrderDisplay(temp->left);
+			cout << temp->data;
+			inOrderDisplay(temp->right);
+		}
+	}
+
+	void preOrderDisplay(Node<DT>* temp) {
+		if (temp != NULL) {
+			cout << temp->data;
+			preOrderDisplay(temp->left);
+			preOrderDisplay(temp->right);
+		}
+	}
+
+	void postOrderDisplay(Node<DT>* temp) {
+		if (temp != NULL) {
+			postOrderDisplay(temp->left);
+			postOrderDisplay(temp->right);
+			cout << temp->data;
+		}
+	}
+
+	~BSTree() {
+		while (root != NULL) {
+			remove(root->data);
+		}
+	}
+};

src/.vs/Binary-Search-Tree/FileContentIndex/420b5a71-a1ae-4ed1-9991-18a89ccd0af8.vsidx

@@ -0,0 +1,31 @@
+
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio Version 17
+VisualStudioVersion = 17.2.32630.192
+MinimumVisualStudioVersion = 10.0.40219.1
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "Binary-Search-Tree", "Binary-Search-Tree.vcxproj", "{3C04C22A-A83F-49B2-BA0C-AC6FFBD492F1}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|x64 = Debug|x64
+		Debug|x86 = Debug|x86
+		Release|x64 = Release|x64
+		Release|x86 = Release|x86
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{3C04C22A-A83F-49B2-BA0C-AC6FFBD492F1}.Debug|x64.ActiveCfg = Debug|x64
+		{3C04C22A-A83F-49B2-BA0C-AC6FFBD492F1}.Debug|x64.Build.0 = Debug|x64
+		{3C04C22A-A83F-49B2-BA0C-AC6FFBD492F1}.Debug|x86.ActiveCfg = Debug|Win32
+		{3C04C22A-A83F-49B2-BA0C-AC6FFBD492F1}.Debug|x86.Build.0 = Debug|Win32
+		{3C04C22A-A83F-49B2-BA0C-AC6FFBD492F1}.Release|x64.ActiveCfg = Release|x64
+		{3C04C22A-A83F-49B2-BA0C-AC6FFBD492F1}.Release|x64.Build.0 = Release|x64
+		{3C04C22A-A83F-49B2-BA0C-AC6FFBD492F1}.Release|x86.ActiveCfg = Release|Win32
+		{3C04C22A-A83F-49B2-BA0C-AC6FFBD492F1}.Release|x86.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+	GlobalSection(ExtensibilityGlobals) = postSolution
+		SolutionGuid = {405651D1-3C7B-44C9-9CE1-059DDCEE7D55}
+	EndGlobalSection
+EndGlobal