求二叉树的右视图
右视图可等效为每个层次最右边的结点
因此在层次遍历的代码基础上稍作修改即可
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
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();
vector<int> layer;
for(int i=0;i<n;i++)
{
layer.push_back(q.front()->val);
if(q.front()->left) q.push(q.front()->left);
if(q.front()->right) q.push(q.front()->right);
q.pop();
}
ans.push_back(layer.back());
}
return ans;
}
};