We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 26fc63c commit dc71942Copy full SHA for dc71942
leetcode/cpp/Tree/1305.cpp
@@ -0,0 +1,33 @@
1
+class Solution {
2
+public:
3
+ vector<int> v;
4
+ void tree1(TreeNode *root)
5
+ {
6
+ if(root!=NULL)
7
8
+ v.push_back(root->val);
9
+ tree1(root->left);
10
+ tree1(root->right);
11
+
12
+ }
13
14
+ void tree2(TreeNode *root)
15
16
17
18
19
+ tree2(root->left);
20
+ tree2(root->right);
21
22
23
24
25
+ vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
26
27
+ tree1(root1);
28
+ tree2(root2);
29
+ sort(v.begin(),v.end());
30
+ return v;
31
32
33
+};
0 commit comments