FPEvalDataset/LeetCodeProblem
0302
1{2 "id": 2306,3 "name": "create_binary_tree_from_descriptions",4 "difficulty": "Medium",5 "link": "https://leetcode.com/problems/create-binary-tree-from-descriptions/",6 "date": "1645920000000",7 "task_description": "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 cases will be generated such that the binary tree is **valid**. **Example 1:** ``` **Input:** descriptions = [[20,15,1],[20,17,0],[50,20,1],[50,80,0],[80,19,1]] **Output:** [50,20,80,15,17,19] **Explanation:** The root node is the node with value 50 since it has no parent. The resulting binary tree is shown in the diagram. ``` **Example 2:** ``` **Input:** descriptions = [[1,2,1],[2,3,0],[3,4,1]] **Output:** [1,2,null,null,3,4] **Explanation:** The root node is the node with value 1 since it has no parent. The resulting binary tree is shown in the diagram. ``` **Constraints:** `1 <= descriptions.length <= 104` `descriptions[i].length == 3` `1 <= parenti, childi <= 105` `0 <= isLefti <= 1` The binary tree described by `descriptions` is valid.",8 "public_test_cases": [9 {10 "label": "Example 1",11 "input": "descriptions = [[20,15,1],[20,17,0],[50,20,1],[50,80,0],[80,19,1]]",12 "output": "[50,20,80,15,17,19] "13 },14 {15 "label": "Example 2",16 "input": "descriptions = [[1,2,1],[2,3,0],[3,4,1]]",17 "output": "[1,2,null,null,3,4] "18 }19 ],20 "private_test_cases": [],21 "haskell_template": "__init__ :: [[Int]] -> Unknown\n__init__ descriptions ",22 "ocaml_template": "let __init__ (descriptions: int list list) : unknown = ",23 "scala_template": "def __init__(descriptions: List[List[Int]]): unknown = { \n \n}",24 "java_template": "public static Object __init__(List<List<Integer>> descriptions) {\n\n}",25 "python_template": "# Definition for a binary tree node.\n# class TreeNode(object):\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution(object):\n def createBinaryTree(self, descriptions):\n \"\"\"\n :type descriptions: List[List[int]]\n :rtype: Optional[TreeNode]\n \"\"\"\n "26}