-
Notifications
You must be signed in to change notification settings - Fork 0
/
cousins.cpp
64 lines (60 loc) · 1.64 KB
/
cousins.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
#include <iostream>
#include <vector>
#include <string>
#define __STDC_LIMIT_MACROS
#include <stdint.h>
#include <climits>
#include <algorithm>
#include <queue>
#include <unordered_map>
using namespace std;
struct TreeNode {
int val;
struct TreeNode* left;
struct TreeNode* right;
TreeNode(int v): val(v), left(NULL), right(NULL){}
};
class Solution {
public:
vector<int> list_cousins(TreeNode* root, int val) {
int flag = 0;
queue<TreeNode*> q;
q.push(root);
while (!q.empty()) {
int size = q.size();
for (int i=0; i < size; i++) {
TreeNode* tmp = q.front(); q.pop();
if ((tmp->left && tmp->left->val == val) || (tmp->right && tmp->right->val == val)) {
flag = 1;
}
else {
if (tmp->left) q.push(tmp->left);
if (tmp->right) q.push(tmp->right);
}
}
if (flag) {
vector<int> res;
int qsize = q.size();
for (int i = 0; i < qsize; i++) {
res.push_back(q.front()->val);
q.pop();
}
return res;
}
}
return {};
}
};
int main() {
struct TreeNode *root = new TreeNode(1);
root->left = new TreeNode(2);
root->right = new TreeNode(3);
root->left->left = new TreeNode(4);
root->left->right = new TreeNode(6);
root->right->right = new TreeNode(5);
vector<int> res;
Solution sol;
res = sol.list_cousins(root, 5);
for (auto x: res)
cout << x << " ";
}