Leetcode 108 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.

A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one.

Input: nums = [-10,-3,0,5,9]
Output: [0,-3,9,-10,null,5]

Input: nums = [1,3]
Output: [3,1]

• Açıklama eklenecek.

    def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:
        def helper(l,r):
            if l>r:
                return None
            m=(l+r)//2
            root = TreeNode(nums[m])
            root.left = helper(l,m-1)
            root.right= helper(m+1,r)
            return root
            
        return helper(0,len(nums) -1)