Element in binary tree can be any order. smaller value can sit as bottom child, so can can nor predict that..
So, just do traverse and store the element in list.
Now, traverse the list and make a binary search tree.
We can not go with array as we do not have size of tree.