/**
* Definition for binary tree
* 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> ret;
if(!root) return ret;
queue<TreeNode *> q;
int rightmost = root->val;
q.push(root);
q.push(NULL);
while (!q.empty()) {
TreeNode *p = q.front();
q.pop();
if (!p) {
ret.push_back(rightmost);
if (!q.empty()) {
q.push(p);
}
} else {
rightmost = p->val;
if (p->left) {
q.push(p->left);
}
if (p->right) {
q.push(p->right);
}
}
}
return ret;
}
};