Added check tree type functions

Author: SameetAsadullah

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

@@ -202,6 +202,107 @@ class BSTree {
 		}
 	}
 
+	bool FullBinaryTree(Node<DT>* temp) {
+
+		if (!temp) {
+			return true;
+		}
+		if (!(temp->right) && !(temp->left)) {
+			return true;
+		}
+		else if (temp->right != NULL && temp->left != NULL) {
+			FullBinaryTree(temp->right);
+			FullBinaryTree(temp->left);
+		}
+		else {
+			return false;
+		}
+	}
+
+	bool PerfectBinaryTree(Node<DT>* temp) {
+
+		bool check = FullBinaryTree(temp);
+
+		if (temp == NULL) {
+			return 1;
+		}
+
+		int left = PerfectBinaryTree(temp->left);
+		int right = PerfectBinaryTree(temp->right);
+
+		if (check) {
+			if ((left == right)) {
+				return true;
+			}
+		}
+		else {
+			return false;
+		}
+	}
+
+	int Count(Node<DT>* temp) {
+		if (!temp) {
+			return 0;
+		}
+
+		return 1 + Count(temp->left) + Count(temp->right);
+	}
+
+	bool CompleteBinaryTree(Node<DT>* temp, int curr = 0)
+	{
+
+		int total = Count(root);
+		if (!temp) {
+			return true;
+		}
+		if (total <= curr) {
+			return false;
+		}
+		CompleteBinaryTree(temp->right, ((2 * curr) + 2));
+		CompleteBinaryTree(temp->left, ((2 * curr) + 1));
+	}
+
+	bool BalancedBinaryTree(Node<DT>* temp) {
+
+		if (!temp) {
+			return 1;
+		}
+
+		int left = calculateHeight(temp->left);
+		int right = calculateHeight(temp->right);
+
+		if (abs(right - left) <= 1) {
+			if (BalancedBinaryTree(temp->left)) {
+				if (BalancedBinaryTree(temp->right)) {
+					return true;
+				}
+			}
+		}
+		else {
+			return false;
+		}
+	}
+
+	bool DegenerateTree(Node<DT>* temp) {
+
+		if (temp->left) {
+			if (temp->right) {
+				return false;
+			}
+			else {
+				DegenerateTree(temp->left);
+			}
+		}
+		else {
+			if (temp->right) {
+				DegenerateTree(temp->right);
+			}
+			else {
+				return true;
+			}
+		}
+	}
+
 	~BSTree() {
 		while (root != NULL) {
 			remove(root->data);

src/.vs/Binary-Search-Tree/FileContentIndex/84f2723c-b173-40eb-bb98-13f171ec551e.vsidx

@@ -13,4 +13,5 @@ int main() {
 	t1.postOrderDisplay(t1.getRoot());
 	cout << endl << "========== In Order Display ===========" << endl << endl;
 	t1.inOrderDisplay(t1.getRoot());
+	cout << "Is Tree a Full Binary Tree: " << t1.FullBinaryTree(t1.getRoot()) << endl;
 }

src/.vs/Binary-Search-Tree/v17/.suo

@@ -1,3 +1,4 @@
   main.cpp
+F:\Uniii\Github Repositories\Binary-Search-Tree-Implementation\src\BSTree.h(220): warning C4715: 'BSTree<AccountsRecords>::FullBinaryTree': not all control paths return a value
 F:\Uniii\Github Repositories\Binary-Search-Tree-Implementation\src\BSTree.h(148): warning C4715: 'BSTree<AccountsRecords>::traverseForRemove': not all control paths return a value
   Binary-Search-Tree.vcxproj -> F:\Uniii\Github Repositories\Binary-Search-Tree-Implementation\src\x64\Debug\Binary-Search-Tree.exe