-
Notifications
You must be signed in to change notification settings - Fork 6
/
1305.cpp
67 lines (49 loc) · 1.55 KB
/
1305.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
//Solution 1 (Naive):-
class Solution {
public:
void dfs(TreeNode* root, vector<int>& ans){
if(!root)
return;
ans.push_back(root -> val);
dfs(root -> left, ans);
dfs(root -> right, ans);
}
vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
vector<int> result;
dfs(root1, result);
dfs(root2, result);
sort(result.begin(), result.end());
return result;
}
};
//Solution 2 (Optimized for time using stacks):-
class Solution {
public:
vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
vector<int> result;
stack<TreeNode*> st1, st2;
while(root1 || root2 || !st1.empty() || !st2.empty()){
while(root1){
st1.push(root1);
root1 = root1 -> left;
}
while(root2){
st2.push(root2);
root2 = root2 -> left;
}
if(st2.empty() || (!st1.empty() && st1.top() -> val <= st2.top() -> val)){
root1 = st1.top();
st1.pop();
result.push_back(root1 -> val);
root1 = root1 -> right;
}
else{
root2 = st2.top();
st2.pop();
result.push_back(root2 -> val);
root2 = root2 -> right;
}
}
return result;
}
};