From 367cce1e0c0f6bd5af2fe1f90de64846d111bfee Mon Sep 17 00:00:00 2001
From: chirag <chiragjain324009@gmail.com>
Date: Wed, 27 Dec 2023 01:05:41 +0530
Subject: [PATCH] I added Binary Search Tree operation performed

---
 .../C++/theory/Binary_Search_Tree.cpp         | 119 ++++++++++++++++++
 1 file changed, 119 insertions(+)
 create mode 100644 MLSA Event-101/C++/theory/Binary_Search_Tree.cpp

diff --git a/MLSA Event-101/C++/theory/Binary_Search_Tree.cpp b/MLSA Event-101/C++/theory/Binary_Search_Tree.cpp
new file mode 100644
index 00000000..d8639f59
--- /dev/null
+++ b/MLSA Event-101/C++/theory/Binary_Search_Tree.cpp	
@@ -0,0 +1,119 @@
+1. Inserting a Node:
+
+C++
+struct Node {
+    int data;
+    Node* left;
+    Node* right;
+};
+
+Node* insert(Node* root, int data) {
+    if (root == nullptr) {
+        return new Node{data, nullptr, nullptr};
+    }
+
+    if (data < root->data) {
+        root->left = insert(root->left, data);
+    } else {
+        root->right = insert(root->right, data);
+    }
+
+    return root;
+}
+//------------------------------------------------------------------------------------------------------------
+2. Searching for a Node:
+
+C++
+bool search(Node* root, int data) {
+    if (root == nullptr) {
+        return
+ 
+false;
+    }
+
+    if (data == root->data) {
+        return
+ 
+true;
+    }
+
+    if (data < root->data) {
+        return search(root->left, data);
+    } else {
+        return search(root->right, data);
+    }
+}
+//------------------------------------------------------------------------------------------------------------
+3. Finding the Minimum Value:
+
+C++
+int findMin(Node* root) {
+    if (root == nullptr) {
+        throw std::runtime_error("Tree is empty");
+    }
+
+    while (root->left != nullptr) {
+        root = root->left;
+    }
+
+    return root->data;
+}
+//------------------------------------------------------------------------------------------------------------
+4. Finding the Maximum Value:
+
+C++
+int findMax(Node* root) {
+    if (root == nullptr) {
+        throw std::runtime_error("Tree is empty");
+    }
+
+    while (root->right != nullptr) {
+        root = root->right;
+    }
+
+    return root->data;
+}
+//------------------------------------------------------------------------------------------------------------
+5. In-Order Traversal (Left, Root, Right):
+
+C++
+void
+ 
+inorderTraversal(Node* root)
+ 
+{
+    if (root != nullptr) {
+        inorderTraversal(root->left);
+        std::cout << root->data << " ";
+        inorderTraversal(root->right);
+    }
+}
+6. Pre-Order Traversal (Root, Left, Right):
+
+C++
+void
+ 
+preorderTraversal(Node* root)
+ 
+{
+    if (root != nullptr) {
+        std::cout << root->data << " ";
+        preorderTraversal(root->left);
+        preorderTraversal(root->right);
+    }
+}
+//------------------------------------------------------------------------------------------------------------
+7. Post-Order Traversal (Left, Right, Root):
+
+C++
+void
+ 
+postorderTraversal(Node* root)
+ 
+{
+    if (root != nullptr) {
+        postorderTraversal(root->left);
+        postorderTraversal(root->right);
+        std::cout << root->data << " ";
+    }
+}
\ No newline at end of file