给定一个二叉树的 根节点 root,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
/**
* 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>ans;
if(!root)return ans;
queue<TreeNode*>q;
q.push(root);
while(!q.empty()){
int n = q.size();
bool f = true;
while(n>0){
n--;
TreeNode* t = q.front();
q.pop();
if(f){
ans.push_back(t->val);
f = false;
}
if(t->right)q.push(t->right);
if(t->left)q.push(t->left);
}
}
return ans;
}
};
思路:层序遍历,每层从右向左进队,每次取第一个值。