2196. Create Binary Tree From Descriptions

LeetCodeArrayHash TableTreeBinary TreeOpen on judge ↗

You are given a 2D integer array descriptions where descriptions[i] = [parenti, childi, isLefti] indicates that parenti is the parent of childi in a binary tree of unique values. Furthermore, - If isLefti == 1, then childi is the left child of parenti. - If isLefti == 0, then childi is the right child of parenti. Construct the binary tree described by descriptions and return its root. The test

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI