Available question text
Given an unordered list of all nodes of an N-ary tree (nodes have children pointers but no parent pointers), identify the root — the single node that never appears as any node's child — in linear time (e.g., by set difference or XOR of values).
Related questions
Continue with questions that share topics or the same question type.
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
Google
Leetcode 1506. Find Root of N-Ary Tree
Reported May 19, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source