Package g1301_1400.s1361_validate_binary_tree_nodes

Class Solution

java.lang.Object

g1301_1400.s1361_validate_binary_tree_nodes.Solution

public class Solution
extends Object

1361 - Validate Binary Tree Nodes.<p>Medium</p> <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><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/08/23/1503_ex1.png" alt="" /></p> <p><strong>Input:</strong> n = 4, leftChild = [1,-1,3,-1], rightChild = [2,-1,-1,-1]</p> <p><strong>Output:</strong> true</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/08/23/1503_ex2.png" alt="" /></p> <p><strong>Input:</strong> n = 4, leftChild = [1,-1,3,-1], rightChild = [2,3,-1,-1]</p> <p><strong>Output:</strong> false</p> <p><strong>Example 3:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2019/08/23/1503_ex3.png" alt="" /></p> <p><strong>Input:</strong> n = 2, leftChild = [1,0], rightChild = [-1,-1]</p> <p><strong>Output:</strong> false</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == leftChild.length == rightChild.length</code></li> <li><code>1 <= n <= 10⁴</code></li> <li><code>-1 <= leftChild[i], rightChild[i] <= n - 1</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	validateBinaryTreeNodes(int n, int[] leftChild, int[] rightChild)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

validateBinaryTreeNodes

public boolean validateBinaryTreeNodes(int n,
 int[] leftChild,
 int[] rightChild)