29 August "Problem of the Day" Answer

                                                                  GeeksforGeeks
                                                           
The Question is :- "Next Right Node"
Answer :-

class Solution
{
public:
    Node *nextRight(Node *root, int key)
    {
        int ct =0;
        queue<Node*> q;
        if(!root)
        return NULL;
        q.push(root);
        while(!q.empty()){
            int sz = q.size();
            while(sz--){
                Node* temp = q.front();
                q.pop();
                if(ct == 1)
                return temp;
                if(temp -> left)
                {
                    q.push(temp -> left);
                }
                if(temp -> right)
                q.push(temp -> right);
                if(temp -> data == key)
                ct = 1;
            }
            if(ct == 1)
            {
                Node* data=new Node(-1);
       return data;
            }
        }
        return root;
        //code here
    }
};

Hope you understand the answer, and complete it.
Stay Connected for daily Problem of the Day answers.

Thank you All!