108. Convert Sorted Array to Binary Search Tree.py

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

Given an integer array nums where the elements are sorted in ascending order,
convert it to a height-balanced binary search tree.

"""


# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def sortedArrayToBST(self, nums):
        """
        :type nums: List[int]
        :rtype: TreeNode
        """

        if len(nums) == 0:
            return

        mid_pos = len(nums) // 2

        return TreeNode(
            val=nums[mid_pos],
            left=self.sortedArrayToBST(nums[:mid_pos]),
            right=self.sortedArrayToBST(nums[mid_pos+1:])
        )