Check if two Nodes are Cousins.cpp

//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;

struct Node {
    int data;
    Node *left;
    Node *right;

    Node(int val) {
        data = val;
        left = right = NULL;
    }
};
// Function to Build Tree
Node* buildTree(string str)
{   
    // Corner Case
    if(str.length() == 0 || str[0] == 'N')
            return NULL;
    
    // Creating vector of strings from input 
    // string after spliting by space
    vector<string> ip;
    
    istringstream iss(str);
    for(string str; iss >> str; )
        ip.push_back(str);
        
    // Create the root of the tree
    Node* root = new Node(stoi(ip[0]));
        
    // Push the root to the queue
    queue<Node*> queue;
    queue.push(root);
        
    // Starting from the second element
    int i = 1;
    while(!queue.empty() && i < ip.size()) {
            
        // Get and remove the front of the queue
        Node* currNode = queue.front();
        queue.pop();
            
        // Get the current node's value from the string
        string currVal = ip[i];
            
        // If the left child is not null
        if(currVal != "N") {
                
            // Create the left child for the current node
            currNode->left = new Node(stoi(currVal));
                
            // Push it to the queue
            queue.push(currNode->left);
        }
            
        // For the right child
        i++;
        if(i >= ip.size())
            break;
        currVal = ip[i];
            
        // If the right child is not null
        if(currVal != "N") {
                
            // Create the right child for the current node
            currNode->right = new Node(stoi(currVal));
                
            // Push it to the queue
            queue.push(currNode->right);
        }
        i++;
    }
    
    return root;
}

bool isCousins(Node*root , int x , int y);

int main()
{

    int t;
	scanf("%d ",&t);
    while(t--)
    {
        string s;
		getline(cin,s);
        Node* root = buildTree(s);
        int x , y;
        scanf("%d ",&x);
		scanf("%d ",&y);
        if(x==y)
        {
            cout<<"0\n";
            continue;
        }
        cout <<isCousins(root,x,y)<< endl;
    }
    return 1;
}
// } Driver Code Ends


/*Complete the function below
Node is as follows:
struct Node {
    int data;
    Node *left;
    Node *right;

    Node(int val) {
        data = val;
        left = right = NULL;
    }
};
*/
// Returns true if the nodes with values 'a' and 'b' are cousins. Else returns false
void solve(Node* root, int a, int b, Node* parent,int &depthA, 
int &depthB,int &parent1 ,int &parent2,int currDepth){
    if(root==NULL) return ;
    if(root->data==a){
        depthA=currDepth;
        parent1=parent->data;
        return ;
    }
    if(root->data==b){
        depthB=currDepth;
        parent2=parent->data;
        return ;
    }
    solve(root->left,a,b,root,depthA,depthB,parent1,parent2,currDepth+1);
    solve(root->right,
    a,b,root,depthA,depthB,parent1,parent2,currDepth+1);
}
bool isCousins(Node *root, int a, int b)
{
   //add code here.
   int depthA=-1;
   int depthB=-1;
   int parent1=-1;
   int parent2=-1;
    solve(root, a, b,root ,depthA,depthB,parent1,parent2,0);
   if(depthA==-1 || depthB==-1 || parent1==-1 || parent2==-1) return false;
    if(parent1!=parent2 && depthA==depthB){
        return true;
    }
    return false;
}