Leetcode 617 Solution

This article provides solution to leetcode question 617 (merge-two-binary-trees)
Categories:
Tags:
Access this page by simply typing in "lcs 617" in your browser address bar if you have bunnylol configured.

https://leetcode.com/problems/merge-two-binary-trees

Solution

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
        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;
    }
};