NeetCode #410LC-1506MediumTreesNC Algo100
← Back to All Problems#410 · #1506 · Find Root of N-Ary Tree(找到 N 叉树的根节点)
📌 Problem Statement & Constraints
You are given all the nodes of an N-ary tree as an array. Each node has a unique value and a
children list. Return the root of the tree. Constraints: the number of nodes is in [1, 5 * 10^4], 1 <= Node.val <= 5 * 10^4.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!