ds-algo-study/DS-n-Algos/Trees/leetcode108-sorted-arr-2-bst/Convert Sorted Array to Binary Search Tree.md

Just experimenting with publishing a package

# Convert Sorted Array to Binary Search Tree

> Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of _every_ node never differ by more than 1.

**Example:**

Given the sorted array: \[-10,-3,0,5,9\],

One possible answer is: \[0,-3,9,-10,null,5\], which represents the following height balanced BST:

      0
     / \\
   -3   9
   /   /
 -10  5


[Source](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)