Question

How to convert a binary tree into binary search tree keeping the structure of tree intact?

Answer 1

Simple approach
1) Create a temp array arr[] that stores inorder traversal of the tree. This step takes O(n) time.
2) Sort the temp array arr[]. Time complexity of this step depends upon the sorting algorithm.
3) Again do inorder traversal of tree and copy array elements to tree nodes one by one. This step takes O(n) time.

Answer 2

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.

Comments

Looks that you will not get the same structure if you follow this approach.