Search⌘ K
AI Features
Home
Courses
Learn Data Structures and Algorithms in JavaScript

Problem: Convert Sorted Array to Binary Search Tree

Understand how to convert a strictly increasing sorted array into a height-balanced binary search tree by selecting middle elements recursively. This lesson teaches you the divide and conquer strategy to maintain balance, apply BST properties, and analyze time and space complexity for efficient implementations.

We'll cover the following...

Statement

You are given an integer array nums whose elements are sorted in strictly increasing order. Your task is to construct a height-balanced binary search tree (BST) from this array and return its root.

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

Note: Multiple valid height-balanced BSTs may exist for a given input. Any valid answer will be accepted.

Constraints:

  • 1≤1 \leq nums.length ≤104\leq 10^4

  • −104≤-10^4 \leq nums[i] ...