Merge Two Binary Trees
Given two binary trees,imagine that when you put one of them to cover
the other, some nodes of the two trees are overlapped
while the others are not.
You need to merge them into a new binary tree. The merge rule is that
if two nodes overlap, then sum node values up as the new value of
the merged node.
Otherwise, the NOT null node will be used as the node of new tree.
Example 1:
Input:
Tree 1 Tree 212/ \ / \
3213/ \ \
547
Output:
Merged tree:3/ \
45/ \ \
547
Note: The merging process must start from the root nodes of both trees.