O(n) time and O(1) space using recursion

108. Convert Sorted Array to Binary Search Tree/108_1. Convert Sorted Array to Binary Search Tree.py

@@ -0,0 +1,15 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
+        if not nums:
+            return None
+        n = len(nums)
+        root = TreeNode(nums[n//2])
+        root.left = self.sortedArrayToBST(nums[:n//2])
+        root.right = self.sortedArrayToBST(nums[n//2+1:])
+        return root