题目:
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
Example:
Input: [1,2,3,null,5,null,4] Output: [1, 3, 4] Explanation: 1 <--- / \ 2 3 <--- \ \ 5 4 <---
思路:
看上去有点花里胡哨,其实就是BFS找到当前层最右的点即可,是一道练基础的题。这里我们用queue来循环进行BFS,唯一要主义的点是queue是先进先出,所以对于当前层,我们遍历到queue在当前层的最后一个node时把它记入进答案即可。
代码:
/**
* 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> res;
if(!root)
return res;
queue<TreeNode*> s;
s.push(root);
while(s.size())
{
int len=s.size();
for(int i=0;i<len;i++)
{
TreeNode* temp=s.front();
s.pop();
if(i==len-1)
res.push_back(temp->val);
if(temp->left)
s.push(temp->left);
if(temp->right)
s.push(temp->right);
}
}
return res;
}
};