Leetcode617. Merge Two Binary Trees (C++)

Leetcode617. Merge Two Binary Trees

简单题，迭代比递归复杂一点点

代码如下：

/**
 * 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) {
        /*
         * Recursion
         * Runtime: 56 ms, 67.75%
         * Memory Usage: 21.9 MB, 19.44%
         */
        if (t1 == NULL) return t2;
        if (t2 == NULL) return t1;
        t1->val += t2->val;
        t1->left = mergeTrees(t1->left, t2->left);
        t1->right = mergeTrees(t1->right, t2->right);
        return t1;
    }

    TreeNode* mergeTrees_iter(TreeNode* t1, TreeNode* t2) {
        /*
         * Iteration
         * Runtime: 44 ms, 93.48%
         * Memory Usage: 22.4 MB, 19.44%
         */
        if (t1 == NULL) return t2;
        if (t2 == NULL) return t1;
        queue<TreeNode*> q; // Queue and Stack are both ok
        q.push(t1);
        q.push(t2);
        while (!q.empty()) {
            TreeNode* r1 = q.front(); q.pop();
            TreeNode* r2 = q.front(); q.pop();
            r1->val += r2->val;
            // left
            if (r1->left != NULL && r2->left != NULL) {
                q.push(r1->left);
                q.push(r2->left);
            }
            else if (r1->left == NULL && r2->left != NULL)
                r1->left = r2->left;
            // right
            if (r1->right != NULL && r2->right != NULL) {
                q.push(r1->right);
                q.push(r2->right);
            }
            else if (r1->right == NULL && r2->right != NULL)
                r1->right = r2->right;
        }
        return t1;
    }
};