Convert sorted array to binary search tree

preview_player
Показать описание
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 differs by more than 1.
Рекомендации по теме
Комментарии
Автор

Try not making copies and pass by reference to improve time complexity.

motivationtipsknowledge