All Elements in Two Binary Search Trees LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> v;
4
  void Temp(TreeNode *root) {
5
    if (root != NULL) {
6
      Temp(root->left);
7
      v.push_back(root->val);
8
      Temp(root->right);
9
    }
10
  }
11
  vector<int> getAllElements(TreeNode *root1, TreeNode *root2) {
12
    Temp(root1);
13
    Temp(root2);
14
    sort(v.begin(), v.end());
15

16
    return v;
17
  }
18
};