From f710b818a96da6564a241cb982c9da46a26e7e3d Mon Sep 17 00:00:00 2001
From: danzang100 <12danysamuel@gmail.com>
Date: Wed, 12 Mar 2025 23:34:40 +0530
Subject: [PATCH] Solution #700 - Daniel/Edited - 12.03.2025

---
 .../Explanation - BST Search.md                 |  1 +
 .../Solution - BST Search.cpp                   | 17 +++++++++++++++++
 2 files changed, 18 insertions(+)
 create mode 100644 Trees (Binary Trees)/#700 - BST Search - Easy/Explanation - BST Search.md
 create mode 100644 Trees (Binary Trees)/#700 - BST Search - Easy/Solution - BST Search.cpp

diff --git a/Trees (Binary Trees)/#700 - BST Search - Easy/Explanation - BST Search.md b/Trees (Binary Trees)/#700 - BST Search - Easy/Explanation - BST Search.md
new file mode 100644
index 0000000..e3a9c07
--- /dev/null
+++ b/Trees (Binary Trees)/#700 - BST Search - Easy/Explanation - BST Search.md	
@@ -0,0 +1 @@
+Simple straightforward problem of traversing a bst to find a given element.
diff --git a/Trees (Binary Trees)/#700 - BST Search - Easy/Solution - BST Search.cpp b/Trees (Binary Trees)/#700 - BST Search - Easy/Solution - BST Search.cpp
new file mode 100644
index 0000000..3395c48
--- /dev/null
+++ b/Trees (Binary Trees)/#700 - BST Search - Easy/Solution - BST Search.cpp	
@@ -0,0 +1,17 @@
+class Solution {
+    public:
+        TreeNode* searchBST(TreeNode* root, int val) {
+            if(root != NULL){
+                if(root -> val == val) return root;
+                else{
+                    if(root -> val < val){
+                        return searchBST(root-> right, val);
+                    }
+                    else{
+                        return searchBST(root->left, val);
+                    }
+                }
+            }
+            return NULL;
+        }
+    };
\ No newline at end of file