리트코드 108번 Convert Sorted Array to Binary Search Tree

Problem

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

Solution

# Definition for a binary tree node.
from typing import List, Optional

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
        
        mid = len(nums) // 2
        node = TreeNode(nums[mid])
        node.left = self.sortedArrayToBST(nums[:mid])
        node.right = self.sortedArrayToBST(nums[mid+1:])
        
        return node

주어진 nums를 binary search를 통해 쪼개 나가며 트리를 구성하면 된다.

Reference

파이썬 알고리즘 인터뷰 50번