# Leetcode 108 - Convert sorted array to bst

`Note:`

- As long as you pick the
`middle`

as root, you WILL get a`balanced BST`

. - Use floor function, so index won’t overflow.

Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.

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

**Example**

1 | Input: nums = [-10,-3,0,5,9] |

1 | /** |