[LeetCode][Python3] 108. Convert Sorted Array to Binary Search Tree

Problem :

https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/

My Solution :

# 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, nums):

"""

:type nums: List[int]

:rtype: TreeNode

"""

if nums:

mid = len(nums)//2

node = TreeNode(nums[mid])

node.left = self.sortedArrayToBST(nums[:mid])

node.right = self.sortedArrayToBST(nums[mid+1:])

return node