Package g1301_1400.s1361_validate_binary_tree_nodes

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1361 - Validate Binary Tree Nodes\.

    Medium

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

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

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

    Example 1:

    Input: n = 4, leftChild = 1,-1,3,-1, rightChild = 2,-1,-1,-1

    Output: true

    Example 2:

    Input: n = 4, leftChild = 1,-1,3,-1, rightChild = 2,3,-1,-1

    Output: false

    Example 3:

    Input: n = 2, leftChild = 1,0, rightChild = -1,-1

    Output: false

    Constraints:

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

    • <code>1 <= n <= 10<sup>4</sup></code>

    • -1 &lt;= leftChild[i], rightChild[i] &lt;= n - 1

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean validateBinaryTreeNodes(Integer n, IntArray leftChild, IntArray rightChild)

      • Methods inherited from class java.lang.Object

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