You are given $n$ binary tree nodes numbered from $0$ to n $- 1$. For each node i, its left child is leftChild[i] and its right child is rightChild[i]. If a node i has no left child, leftChild[i] is $-1$. Similarly, if it has no right child, rightChild[i] is $-1$.

Return true if and only if all given nodes form exactly one valid binary tree. Otherwise, return false.

Constraints:

• n $==$ leftChild.length $==$ rightChild.length

• $1 \le$ n $\le 10^4$

• $-1 \le$ leftChild[i], rightChild[i] $\le$ n $- 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.