[leetcode 199] Binary Tree Right Side View

Question:

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

分析：

观察可以看出，输出的每个元素都是树的每一层的最后一个元素，所以借用队列采用层序遍历，每遇到每层的最后一个元素就存起来即可。

代码如下：

<span style="font-size:14px;">/**
 * 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*> que;
        que.push(root);
        que.push(NULL);
        while(que.size() != 0){
            TreeNode* top = que.front();
            que.pop();
            if(top->left != NULL)
                que.push(top->left);
            if(top->right != NULL)
                que.push(top->right);
            if(que.front() == NULL){
                res.push_back(top->val);
                //que.push(NULL);
                que.pop();
                if(!que.empty()){
                    que.push(NULL);
            }
                
            }
        }
        return res;
    }
};
</span>