题目描述
思路分析
二叉树+BFS
每层最后一个点加入答案
代码实现
/**
* 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) {
queue<TreeNode*> q;
vector<int> ans;
if(!root) return ans;
q.push(root);
while(q.size()){
auto len=q.size();
for(int i=0;i<len;i++){
auto t=q.front();
q.pop();
if(t->left) q.push(t->left);
if(t->right) q.push(t->right);
if(i==len-1) ans.push_back(t->val);
}
}
return ans;
}
};