[LeetCode 199] Binary Tree Right Side View

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.

For example:
Given the following binary tree,

   1            <---
 /   \
2     3         <---
 \     \
  5     4       <---

You should return [1, 3, 4].

/**
 * 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) {
        queue<TreeNode*> s;
        vector<int> v;
        if(root==NULL)
            return v;
        s.push(root);
        while(!s.empty())
        {
            int len=s.size();
            TreeNode* node;
            for(int i=0;i<len;i++)
            {
                node=s.front();
                s.pop();
                if(node->left!=NULL)
                    s.push(node->left);
                if(node->right!=NULL)
                    s.push(node->right);
            }
            v.push_back(node->val);
        }
        return v;
    }
};