[LeetCode]convert sorted array to binary search tree (완료)

[yeonghwanjeon]

• 문제 링크
• 나의 풀이
  • Recursive로 해결
  • Iterative도 고민해볼 필요가 있음

    
    # Definition for a binary tree node.
    # class TreeNode(object):
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None

class Solution(object):

def sortedArrayToBST(self, nums):
    if not nums:
        return None

    mid = len(nums) // 2

    root = TreeNode(nums[mid])
    root.left = self.sortedArrayToBST(nums[:mid])
    root.right = self.sortedArrayToBST(nums[mid+1:])

    return root