This is NO.108 problem in leetcode. The description of this problem is: 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 …

Continue reading “Convert Sorted Array to Binary Search Tree”