-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path199.binary-tree-right-side-view.cpp
46 lines (42 loc) · 1.15 KB
/
199.binary-tree-right-side-view.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
#include <queue>
#include <vector>
using namespace std;
/*
* @lc app=leetcode id=199 lang=cpp
*
* [199] Binary Tree Right Side View
*/
// @lc code=start
/**
* 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 {
public:
vector<int> rightSideView(TreeNode* root) {
vector <int> result;
if (root == nullptr) return {};
queue<TreeNode*>q;
q.push(root);
while (!q.empty()) {
int size = q.size();
for (int i = 0; i < size; i++) {
if (q.front()->left != nullptr) q.push(q.front()->left);
if (q.front()->right != nullptr) q.push(q.front()->right);
if (i == size - 1) {
result.push_back(q.front()->val);
}
q.pop();
}
}
return result;
}
};
// @lc code=end