617. Merge Two Binary Trees | LeetCode Solution

617. Merge Two Binary Trees

You are given two binary trees root1 and root2.

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 the two trees 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 the new tree.

Return the merged tree.

Note: The merging process must start from the root nodes of both trees.

Example 1:

Input: root1 = [1,3,2,5], root2 = [2,1,3,null,4,null,7]
Output: [3,4,5,5,4,null,7]

Example 2:

Input: root1 = [1], root2 = [1,2]
Output: [2,2]

Constraints:

The number of nodes in both trees is in the range [0, 2000].
-104 <= Node.val <= 104

The solution to the above question is-

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
        if(t1==NULL)return t2;
        if(t2==NULL)return t1;
        
        queue<pair<TreeNode* , TreeNode*>>s;
        s.push({t1,t2});
        while(!s.empty()){
            TreeNode* f=s.front().first;
            TreeNode* se=s.front().second;
            if(se!=NULL)
            f->val+=se->val;
            s.pop();
            if(f->left==NULL){
                f->left=se->left;
            }
            else if(se->left){
                s.push({f->left,se->left});
            }
            if(f->right==NULL){
                f->right=se->right;
            }
            else if(se->right){
                s.push({f->right,se->right});
            }
            
            
        }
        return t1;
    }
};