✅Easy & Clear Solution Python 3✅
\n\n# Code\n\n# Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, val=0, left=None, right=None):\n#         self.val = val\n#     
\n\n# Code\n```\n# Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, val=0, left=None, right=None):\n#         self.val = val\n#         self.left = left\n#         self.right = right\nclass Solution:\n    def sortedArrayToBST(self, nums: List[int]) -> TreeNode:\n        def cv(node,vals)->TreeNode:\n            if vals:\n                mid=len(vals)//2\n                node.val,node.left,node.right=vals[mid],cv(TreeNode(),vals[:mid]),cv(TreeNode(),vals[mid+1:])\n                return node\n            else:\n                return None\n        return cv(TreeNode(),nums)\n```
['Recursion', 'Python3']