##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Build a balanced BST
Given an integer array where elements are sorted in ascending order, convert it to a height-balanced BST.
A height-balanced BST is one where the depth of the two subtrees of every node never differs by more than one.
Example: could become or . This problem teaches you how to construct balanced trees from sorted data. Constraints: array length from to , values from to .
