108.convert-sorted-array-to-binary-search-tree.py

#
# @lc app=leetcode id=108 lang=python3
#
# [108] Convert Sorted Array to Binary Search Tree
#

# @lc code=start
# 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]) -> Optional[TreeNode]:
        if not nums:
            return None
        midNode = len(nums) // 2

        return TreeNode(nums[midNode],
            self.sortedArrayToBST(nums=nums[:midNode]),
            self.sortedArrayToBST(nums=nums[midNode+1:]))
# @lc code=end