Convert Sorted Array to Binary Search Tree

Try to solve the Convert Sorted Array to Binary Search Tree problem.


Given an array of integers, nums, sorted in ascending order, your task is to construct a height-balanced binary search tree (BST) from this array.

In a height-balanced BST, the difference of heights of the left subtree and right subtree of any node is not more than 1.

Note: There can be multiple valid BSTs for a given input.


  • 11 \leq nums.length 103\leq 10^3
  • 104-10^4 \leq nums[i] 104\leq 10^4
  • nums is sorted in strictly ascending order.


Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy