chore: remove main from binary_search_tree.cpp

Author: realstealthninja

data_structures/binary_search_tree.cpp

@@ -122,53 +122,4 @@ void Post(node *n) {
     }
 }
 
-int main() {
-    queue.front = 0;
-    queue.rear = 0;
-    int value;
-    int ch;
-    node *root = new node;
-    std::cout << "\nEnter the value of root node :";
-    std::cin >> value;
-    root->val = value;
-    root->left = NULL;
-    root->right = NULL;
-    do {
-        std::cout << "\n1. Insert"
-                  << "\n2. Delete"
-                  << "\n3. Breadth First"
-                  << "\n4. Preorder Depth First"
-                  << "\n5. Inorder Depth First"
-                  << "\n6. Postorder Depth First";
-
-        std::cout << "\nEnter Your Choice : ";
-        std::cin >> ch;
-        int x;
-        switch (ch) {
-        case 1:
-            std::cout << "\nEnter the value to be Inserted : ";
-            std::cin >> x;
-            Insert(root, x);
-            break;
-        case 2:
-            std::cout << "\nEnter the value to be Deleted : ";
-            std::cin >> x;
-            Remove(root, root, x);
-            break;
-        case 3:
-            BFT(root);
-            break;
-        case 4:
-            Pre(root);
-            break;
-        case 5:
-            In(root);
-            break;
-        case 6:
-            Post(root);
-            break;
-        }
-    } while (ch != 0);
-
-    return 0;
-}
+int main() { return 0; }