-
Notifications
You must be signed in to change notification settings - Fork 0
/
199. Binary Tree Right Side View 2.cpp
55 lines (45 loc) · 1.26 KB
/
199. Binary Tree Right Side View 2.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
// https://leetcode.com/problems/binary-tree-right-side-view/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution
{
vector<int> result;
public:
vector<int> rightSideView(TreeNode *root)
{
if (root == nullptr)
return result;
bfs(root);
return result;
}
void bfs(TreeNode *root)
{
queue<TreeNode *> nodes;
nodes.push(root);
result.push_back(root->val);
while (!nodes.empty())
{
int size = nodes.size();
for (int i = 0; i < size; ++i)
{
TreeNode *current = nodes.front();
nodes.pop();
if (current->right != nullptr)
nodes.push(current->right);
if (current->left != nullptr)
nodes.push(current->left);
}
if (nodes.size() > 0)
result.push_back(nodes.front()->val);
}
}
};