NeetCode #416LC-2196MediumTrees
← Back to All Problems

#416 · #2196 · Create Binary Tree From Descriptions(根据描述创建二叉树)

📌 Problem Statement & Constraints

You are given a 2D array descriptions where descriptions[i] = [parent, child, isLeft] describes a binary tree edge. Return the root of the reconstructed tree. All node values are unique and the input describes a valid binary tree. Constraints: 1 <= descriptions.length <= 10^4, 1 <= parent, child <= 10^5.
🔒

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!