Update 701. Insert into a Binary Search Tree

Medo3-coder · web-flow · commit f875853293e7 · 2022-06-13T00:23:52.000+02:00
diff --git a/Tree/701. Insert into a Binary Search Tree b/Tree/701. Insert into a Binary Search Tree
@@ -1,19 +1,6 @@
 
 ////////////////------------------RECURSIVE SOLUTIONS
 
-
-
-/**
- * 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) {}
- * };
- */
 class Solution {
 public:
     TreeNode* insertIntoBST(TreeNode* root, int val) {
@@ -30,3 +17,54 @@ public:
         
     }
 };
+
+
+/////////////////----------------------------------iteratve solution 
+
+
+
+class Solution {
+public:
+    TreeNode* insertIntoBST(TreeNode* root, int val) {
+        if(root == NULL)
+        {
+            return new TreeNode(val);
+        }
+        
+        TreeNode* curr = root ;
+            
+        
+        while(true)
+        {
+            if(curr->val <= val)
+            {
+                if(curr->right !=NULL)
+                {
+                     curr = curr->right;
+                }
+                else
+                {
+                    curr->right = new TreeNode(val);
+                    break ;
+                }
+              
+            }
+            else
+            {
+                if(curr->left != NULL)
+                {
+                    curr = curr->left ;
+                }
+                else
+                {
+                    curr->left = new TreeNode(val);
+                    break ;
+                }
+            }
+          
+        }
+        
+        return root ;
+        
+    }
+};
