Python  Simple Solution Beats 100%
\tdef helper(treelist):\n\t\tif len(treelist)==0:\n\t\t\treturn None\n\t\tif len(treelist)==1:\n\t\t\treturn TreeNode(treelist[0])\n\t\tmid = len(treelist)//2\n
\tdef helper(treelist):\n\t\tif len(treelist)==0:\n\t\t\treturn None\n\t\tif len(treelist)==1:\n\t\t\treturn TreeNode(treelist[0])\n\t\tmid = len(treelist)//2\n\t\ttreelist[mid] = TreeNode(treelist[mid])\n\t\ttreelist[mid].left = helper(treelist[:mid])\n\t\ttreelist[mid].right = helper(treelist[mid+1:])\n\t\treturn treelist[mid]\n\n\tclass Solution:\n\t\tdef sortedArrayToBST(self, nums: List[int]) -> TreeNode:\n\t\t\tif nums==[]:\n\t\t\t\treturn None\n\n\t\t\treturn helper(nums)\n
['Python', 'Python3']