you n binary tree node number 0 n 1 node child leftChildi rightChildi return true give node form exactly valid binary treeif node leave child leftchildi equal 1 similarly right childnote node value use node number problem Example 1input n 4 leftchild 1131 rightchild 2111output trueExample 2input n 4 leftchild 1131 rightchild 2311output falseexample 3input n 2 leftchild 10 rightchild 11output false Constraintsn leftchildlength rightchildlength1 n 1041 leftchildi rightchildi n 1