Day 155: Right View of Binary Tree.cpp

public:
    //Function to return list containing elements of right view of binary tree.
     vector<int> rightView(Node *root)
    {
        vector<int>ans;
        queue<Node*>q;
        q.push(root);
        while(!q.empty())
        {
            Node* node=q.front();
            int n=q.size();
            ans.push_back(node->data);
            while(n--)
            {
                Node* temp=q.front();
                q.pop();
                if(temp->right)
                  q.push(temp->right);
                if(temp->left)
                  q.push(temp->left);
                
            }
        }
        return ans;
    }