186_right_view_of_binary_tree.py

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

    }
};