\#include bits/stdc++.h> using namespace std; class Node \{ public: int data; Node * Left; Node right; Node (int d) \{ data =d; left = NULL; right = NULL; \} \}; class Solution \{ public: void preorder (Node *root) \{ if ( root == NULL ) return; std: : cout root->data " " preorder (root left); preorder (root->right); \} / Node is defined as class Node \{ public: int data; Node left; Node *right; Node (int d) \{ data =d; left = NULL; right = NULL; \} \}; / Node * insert(Node * root, int data) \{ return root; \} \}; int main() \{ Solution myTree; Node root = NULL; int t; int data; std: : cin t; while (t>){ std: :cin data; root = myTree. insert (root, data ); \} myTree.preOrder(root); return 0 ; \} You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node insert (Node root , int data) \{ \} Constraints - No. of nodes in the tree 500 Output Format Return the root of the binary search tree after inserting the value into the tree. Sample Input \begin{tabular}{|c|} \hline 4 \\ \hline 11 \\ 247 \\ 1/ \\ \hline 13 \\ \hline \end{tabular} The value to be inserted is 6 . Sample Output