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: Optional[TreeNode]
        """
        # Base case: if the list is empty, return None
        if not nums:
            return None

        # Find the middle element and make it the root
        mid = len(nums) // 2
        root = TreeNode(nums[mid])

        # Recursively construct the left subtree with the left half of the array
        root.left = self.sortedArrayToBST(nums[:mid])

        # Recursively construct the right subtree with the right half of the array
        root.right = self.sortedArrayToBST(nums[mid+1:])

        return root