108

Author: viewv

108. Convert Sorted Array to Binary Search T.py

@@ -0,0 +1,17 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+
+class Solution:
+    def sortedArrayToBST(self, num):
+        if not num:
+            return None
+        mid = len(num)//2
+        root = TreeNode(num[mid])
+        root.left = self.sortedArrayToBST(num[:mid])
+        root.right = self.sortedArrayToBST(num[mid+1:])
+        return root