00:03
So to solve this question, answer number 1 is, constructing a valence tree from a sorted array is easy in o in time.
00:29
And we can access the middle element of the array in over time.
01:05
So the algorithm for this work is, in step 1, get the middle element of the array in then over time, step 2, make it the root for the bst.
02:27
Binary search tree.
02:39
Step 3, recursively do it for the left half of the array and the right half as well.
03:39
In this step, we have two sub -steps.
03:45
Find middle element in the left half and make it the left child.
04:33
Second, we point the middle element in the right half and make it the right child...