sir i want to you take a look on the given steps:-
1.) given any unsorted array , sort it first.
2.) Use build Balanced binary tree from array method like the one sir taught…in which a balanced binary tree is maded by finding mid point as a root.
So, can i conclude that by following the above two steps…i can build BST without using the actual implementation code of BST instead using build balanced binary tree from sorted array method.
please clarify it sir…