Insert In BST Implemented

Author: MohammadFahad1

input.txt

@@ -2,4 +2,5 @@
 20 36
 10 22 30 40
 5 12 -1 -1 28 -1 38 48
--1 -1 -1 -1 -1 -1 -1 -1 -1 -1
+-1 -1 -1 -1 -1 -1 -1 -1 -1 -1
+21

insert_in_bst.cpp

@@ -0,0 +1,127 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Node
+{
+public:
+    int val;
+    Node *left;
+    Node *right;
+    Node(int val)
+    {
+        this->val = val;
+        this->left = NULL;
+        this->right = NULL;
+    }
+};
+
+Node *input_binary_tree()
+{
+    int val;
+    cin >> val;
+
+    Node *root;
+
+    if (val == -1)
+        root = NULL;
+    else
+        root = new Node(val);
+
+    queue<Node *> q;
+    if (root)
+        q.push(root);
+
+    while (!q.empty())
+    {
+        // 1. Q theke ber kore ano
+        Node *f = q.front();
+        q.pop();
+
+        // 2. Jabotiyo ja kaj ache koro
+        int l, r;
+        cin >> l >> r;
+
+        Node *left, *right;
+
+        if (l == -1)
+            left = NULL;
+        else
+            left = new Node(l);
+
+        if (r == -1)
+            right = NULL;
+        else
+            right = new Node(r);
+
+        f->left = left;
+        f->right = right;
+
+        // 3. Children gulo k push koro
+        if (f->left)
+            q.push(f->left);
+        if (f->right)
+            q.push(f->right);
+    }
+    return root;
+}
+
+void level_order(Node *root)
+{
+    queue<Node *> q;
+    q.push(root);
+    while (!q.empty())
+    {
+        Node *f = q.front();
+        q.pop();
+
+        cout << f->val << " ";
+
+        if (f->left)
+            q.push(f->left);
+        if (f->right)
+            q.push(f->right);
+    }
+}
+
+void insert(Node *&root, int x)
+{
+    if (root == NULL)
+    {
+        root = new Node(x);
+        return;
+    }
+
+    if (x < root->val)
+    {
+        if (root->left == NULL)
+        {
+            root->left = new Node(x);
+        }
+        else
+        {
+            insert(root->left, x);
+        }
+    }
+    else
+    {
+        if (root->right == NULL)
+        {
+            root->right = new Node(x);
+        }
+        else
+        {
+            insert(root->right, x);
+        }
+    }
+}
+
+int main()
+{
+    Node *root = input_binary_tree();
+    int x;
+    cin >> x;
+    insert(root, x);
+    level_order(root);
+
+    return 0;
+}

insert_in_bst.exe

@@ -1 +1 @@
-YES
+25 20 36 10 22 30 40 5 12 21 28 38 48