Live Lecture: Convert Sorted Array to BST

In this video we solve LeetCode problem 108. In this solution we reason our way through building a height balanced binary search tree from a sorted input array. We show how the naturally recursive structure of BSTs leads to a straightforward algorithm. We also review the array representation of BSTs.