C program to copy one binary tree to another [closed] - c

Question

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 9 years ago.
Can any one help me with a C program to copy one binary tree to another binary tree?
I am okay with either algorithm or C functions so that I can implement them.
Thank you :)

Answer 1

If the tree you want added is a proper subset (no overlaps) and the tree doesn't have to be balanced, you can just append its root node to the correct insertion point. By that, I mean something like:
10
/ \
1 70
*
5
/ \
2 7
where you can create a link on the right of the 1 to attach to the 5. This will work because the entire sub-tree slots in between 1 and 10 (which is what I meant by "no overlaps").
In fact, if the tree also isn't even sorted, you can just attach the root node to any leaf that you want:
40
/ \
1 10
*
5
/ \
8 789
In that case, overlaps are not a concern since the tree is not sorted so it's a safe bet to assume you don't care about order.
However, if you have a balanced and sorted tree, your best bet is probably to traverse one of the trees and use the insert method to add each value found to the other tree.
That will both properly combine "overlapping" trees and keep the target tree balanced if necessary. So, using the first example above, you'd get something like:
7
/ \
/ \
2 10
/ \ \
1 5 70
The "algorithm" then becomes something like:
def copyTree (source, destination):
item = source.first()
while item != none_left:
destination.insert (item.value)
item = source.next (item)
That way, you don't have to worry about whether the attachment will be problematic because the insert method of the destination tree will automatically do the right thing (sort, balance, etc).