LeetCode 풀기 - 108. Convert Sorted Array to Binary Search Tree

108. Convert Sorted Array to Binary Search Tree

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

문제)

솔루션1) 재귀

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

 

 

 

함께 보면 좋은 글

2022.02.27 - [알고리즘/알고리즘 Basic] - [파이썬] 배열을 바이너리 서치 트리로 변환 ( array to height balanced Binary Search Tree)

[파이썬] 배열을 바이너리 서치 트리로 변환 ( array to height balanced Binary Search Tree)