Create Merge two BST 's

Binary search tree/Merge two BST 's

@@ -0,0 +1,24 @@
+class Solution
+{
+    public:
+    //Function to return a list of integers denoting the node 
+    //values of both the BST in a sorted order.
+    void solve (Node *root,vector<int>&v){
+        if(root==NULL)
+        {
+            return ;
+        }
+        solve(root->left,v);
+        v.push_back(root->data);
+        solve(root->right,v);
+    }
+    vector<int> merge(Node *root1, Node *root2)
+    {
+       //Your code here
+       vector<int>ans;
+       solve(root1,ans);
+       solve(root2,ans);
+       sort(ans.begin(),ans.end());
+       return ans;
+    }
+};