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].

方法1：

/**
 * 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> res;
        if(root==NULL) return res;
        queue<TreeNode*>q;
        q.push(root);
        int thislevel=1,nextlevel=0;
        while(!q.empty())
        {
            TreeNode* front=q.front();
            q.pop();
            if(front->left) {
                q.push(front->left);
                nextlevel++;
            }
            if(front->right) {
                q.push(front->right);
                nextlevel++;
            }

             if(thislevel==1)
            {
                res.push_back(front->val);
                thislevel=nextlevel;
                nextlevel=0;
            }else{
                thislevel--;
            }
        }
        return res;


    }
};

方法2：

/**
 * 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> res;
        if(root==NULL) return res;
        queue<TreeNode*>q;
        q.push(root);
        q.push(NULL);
        while(!q.empty())
        {
            TreeNode* front=q.front();
            q.pop();
            if(front==NULL)
            {
                if(q.empty()) break;
                else
                    q.push(NULL);

            }else{
                if(q.front()==NULL)
                    res.push_back(front->val);
                if(front->left) q.push(front->left);
                if(front->right) q.push(front->right);

            }
           
        }
        return res;


    }
};