Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

108. Convert Sorted Array to Binary Search Tree

My accepted Python solution to LeetCode problem 108, Convert Sorted Array to Binary Search Tree, running in 3ms.

  • Difficulty: Easy
  • Python
  • Runtime 3ms
  • Memory 15.3MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 3ms, memory 15.3MB, accepted 2025-12-23.

python
class Solution(object):
    def sortedArrayToBST(self, nums):
        """
        :type nums: List[int]
        :rtype: Optional[TreeNode]
        """
        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

Source