Convert sorted array to binary search tree | LeetCode 108 | Easy

[@shubhamkale5003]

Your videos are too good

[@chiaueichi7497]

You are awesome! thanks for your explanation.

[@thejakumarrajusomalraju3325]

Thank you

[@TheProximator]

Nice, thank you very much :)

[@RiteshYadav-rc1np]

Nice explanation man just subscribed your channel keep it up and put some more videos

[@lincolnwang6774]

What I don't understand is why we need to create a new root in every recursion (line 33). How did you connect each new root to form the final tree?

[@mikehenshaw4541]

It's from line 34, 35

[@mahimaarora2841]

u have mixed java and javascript I guess...int middle and var root?

[@mahimaarora2841]

@@CodeAndCoffee ya I tried that now it's fine with var..Thanks for the soln and replying to my doubt😊

[@anatoliytkachenko1498]

Like!

[@anm_15]

what if you have array with even indexes ? How will you find the middle ?

[@anm_15]

@@CodeAndCoffee I think for even it should be ((low + high)/2) + 1, to have balance tree....

[@275phuongvy]

thank you