🌲 Day 6

Author: AkashRajpurohit

README.md

@@ -9,8 +9,9 @@
 1. [Number of Recent Calls](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3480/) ➡️ [CPP Solution](Week1/RecentCounter.cpp)
 2. [Combination Sum](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3481/) ➡️ [CPP Solution](Week1/combinationSum.cpp)
 3. [K-diff Pairs in an Array](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3482/) ➡️ [CPP Solution](Week1/findPairs.cpp)
-4. [Remove Covered Intervals](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3482/) ➡️ [CPP Solution](Week1/removeCoveredIntervals.cpp)
-5. [Complement of Base 10 Integer](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3482/) ➡️ [CPP Solution](Week1/bitwiseComplement.cpp)
+4. [Remove Covered Intervals](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3483/) ➡️ [CPP Solution](Week1/removeCoveredIntervals.cpp)
+5. [Complement of Base 10 Integer](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3484/) ➡️ [CPP Solution](Week1/bitwiseComplement.cpp)
+6. [Insert into a Binary Search Tree](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3485/) ➡️ [CPP Solution](Week1/insertIntoBST.cpp)
 
 ## Week 2 🚧
 

Week1/insertIntoBST.cpp

@@ -0,0 +1,60 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+
+/*
+    Recursive Approach
+*/
+class Solution {
+public:
+    TreeNode* insertIntoBST(TreeNode* root, int val) {
+        if(root == NULL) return new TreeNode(val);
+        
+        if(val > root->val)
+            root->right = insertIntoBST(root->right, val);
+        else if(val < root->val)
+            root->left = insertIntoBST(root->left, val);
+        
+        return root;
+    }
+};
+
+/*
+    Iterative Approach
+*/
+class Solution {
+public:
+    TreeNode* insertIntoBST(TreeNode* root, int val) {
+        if(root == NULL) return new TreeNode(val);
+
+        TreeNode* current = root;
+        
+        while(true) {
+            if(val > current->val) {
+                if(current->right != NULL)
+                    current = current->right;
+                else {
+                    current->right = new TreeNode(val);
+                    break;
+                }
+            } else {
+                if(current->left != NULL)
+                    current = current->left;
+                else {
+                    current->left = new TreeNode(val);
+                    break;
+                }
+            }
+        }
+        
+        return root;
+    }
+};