Leetcode: 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) {
        vector<int> ret;
        queue<TreeNode*> q1, q2;
        TreeNode *ptr;
        int flag = 1;

        if (root == NULL) return ret;

        q1.push(root);

        while (!q1.empty() || !q2.empty()) {
            flag = 1;
            if (!q1.empty()) {
                while (!q1.empty()) {
                    ptr = q1.front();
                    q1.pop();
                    if (flag) {
                        ret.push_back(ptr->val);
                        flag = 0;
                    }
                    if (ptr->right) q2.push(ptr->right);
                    if (ptr->left)  q2.push(ptr->left);
                }
            } else {
                while (!q2.empty()) {
                    ptr = q2.front();
                    q2.pop();
                    if (flag) {
                        ret.push_back(ptr->val);
                        flag = 0;
                    }
                    if (ptr->right) q1.push(ptr->right);
                    if (ptr->left)  q1.push(ptr->left);
                }
            }
        }

        return ret;
    }
};