Available question text
Given n nodes and arrays leftChild/rightChild, determine whether they form exactly one valid binary tree — equivalently check there is exactly one root (one node with in-degree 0), every other node has exactly one parent, and the structure is connected with no cycles.
Related questions
Continue with questions that share topics or the same question type.
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Binary Tree Nodes
Coding
- Closest Nodes Queries in a Binary Search Tree
Coding
- Count Good Nodes in Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1361. Validate Binary Tree Nodes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source