Update All Elements in Two Binary Search Trees.cpp

Author: Navpreet1234

All Elements in Two Binary Search Trees.cpp

@@ -11,20 +11,42 @@
  *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
  * };
  */
+
 class Solution {
 public:
-    vector<int> ans;
-    void trav(TreeNode* root){
-        if(root==NULL) return;
-        ans.push_back(root->val);
-        trav(root->left);
-        trav(root->right);
-        return;
-    }
+ 
+ void pushelements(TreeNode*root,vector<int>&v){
+     if(root==nullptr){
+         return;
+     }
+     v.push_back(root->val);
+     pushelements(root->left,v);
+     pushelements(root->right,v);
+ }
+    
     vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
-        trav(root1);
-        trav(root2);
-        sort(ans.begin(), ans.end());
-        return ans;
+     if(root1==nullptr&root2==nullptr){
+          vector<int>v;
+         return v;
+     }
+    else if(root1==nullptr){
+          vector<int>v;
+          pushelements(root2,v);
+        sort(v.begin(),v.end());
+        return v;
+      }
+       else  if(root2==nullptr){
+          vector<int>v;
+          pushelements(root1,v);
+           sort(v.begin(),v.end());
+           return v;
+      }
+        else{
+              vector<int>v;
+              pushelements(root1,v);
+              pushelements(root2,v);
+            sort(v.begin(),v.end());
+           return v;
+        }
     }
-};
+};