<p>You have <code>n</code> binary tree nodes numbered from <code>0</code> to <code>n - 1</code> where node <code>i</code> has two children <code>leftChild[i]</code> and <code>rightChild[i]</code>, return <code>true</code> if and only if <strong>all</strong> the given nodes form <strong>exactly one</strong> valid binary tree.</p>

<p>If node <code>i</code> has no left child then <code>leftChild[i]</code> will equal <code>-1</code>, similarly for the right child.</p>

<p>Note that the nodes have no values and that we only use the node numbers in this problem.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2019/08/23/1503_ex1.png" style="width: 195px; height: 287px;" />
<pre>
<strong>Input:</strong> n = 4, leftChild = [1,-1,3,-1], rightChild = [2,-1,-1,-1]
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2019/08/23/1503_ex2.png" style="width: 183px; height: 272px;" />
<pre>
<strong>Input:</strong> n = 4, leftChild = [1,-1,3,-1], rightChild = [2,3,-1,-1]
<strong>Output:</strong> false
</pre>

<p><strong class="example">Example 3:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2019/08/23/1503_ex3.png" style="width: 82px; height: 174px;" />
<pre>
<strong>Input:</strong> n = 2, leftChild = [1,0], rightChild = [-1,-1]
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>n == leftChild.length == rightChild.length</code></li>
	<li><code>1 &lt;= n &lt;= 10<sup>4</sup></code></li>
	<li><code>-1 &lt;= leftChild[i], rightChild[i] &lt;= n - 1</code></li>
</ul>

class Solution {
public:
    bool bfs(vector<int> adj[], vector<bool> &visited, int curr)
    {
        if(visited[curr]) return false;
        visited[curr]= true;
        for( auto x: adj[curr])
        {
            bool ret = bfs(adj, visited, x);
            if(ret==false)
            {
                return false;
            }
        }
        return true;
    }
    bool validateBinaryTreeNodes(int n, vector<int>& leftChild, vector<int>& rightChild) {
        vector<bool> root(n, true);
        vector<int> parent(n, 0);
        vector<int> adj[n];
        for( int i=0;i<n;i++)
        {
            int right = rightChild[i];
            int left = leftChild[i];
            if( right!=-1)
            {
                root[right]= false; 
                parent[right]++;
                adj[i].push_back(right);
            }
            if( left!=-1)
            {
                root[left]=false;
                parent[left]++;
                adj[i].push_back(left);
            }
        }
        int countRoot = 0;
        int r = -1;
        for(int i=0;i<n;i++)
        {
            bool x = root[i];
            if(x)
            {
                countRoot++;
                r = i;
            }
        }
        if(countRoot!=1) return false;
        for( int x: parent)
        {
            if(x>1) return false;
        }
        vector<bool> visited(n, false);
        if(bfs(adj, visited,r)==false)
        {
            cout<<"Wrong"<<endl;
            return false;
        }
        for( int i=0;i<n;i++)
        {
            bool x = visited[i];
            if( x==false )
            {
                cout<< i<<" ";
                return false;
            }
        }
        return true;
    }
};
44322