diff --git a/1]. DSA + CP/1]. DSA/1]. Data Structures/13]. Binary Search Tree/C++/_13)_Search-in-BST.cpp b/1]. DSA + CP/1]. DSA/1]. Data Structures/13]. Binary Search Tree/C++/_13)_Search-in-BST.cpp
index bad51bdc4..7f131e18c 100644
--- a/1]. DSA + CP/1]. DSA/1]. Data Structures/13]. Binary Search Tree/C++/_13)_Search-in-BST.cpp	
+++ b/1]. DSA + CP/1]. DSA/1]. Data Structures/13]. Binary Search Tree/C++/_13)_Search-in-BST.cpp	
@@ -11,25 +11,6 @@
  */
 class Solution {
 public:
-    
-// <................> Approach - 01 <................>(Recurisive Approach)  
-/*  
-
-    TreeNode* searchBST(TreeNode* root, int val) {
-            
-        if(root == NULL) return {};
-        
-        if(root->val == val) return root;
-        
-        if(root->val > val){
-            return searchBST(root->left,val);
-        }else{
-            return searchBST(root->right,val);
-        } 
-    }  
-    
-*/    
-        
 // <................> Approach - 02 <................>(Iterative Approach)
    
   TreeNode* searchBST(TreeNode* root, int val) {
@@ -48,4 +29,4 @@ class Solution {
         return {};
         
     }
-};
\ No newline at end of file
+};