Merge_Two_Binary_Trees.cpp

/**
 * 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 and !t2) {
            return nullptr;
        }
        TreeNode* currNode = new TreeNode((t1 ? t1->val : 0) + (t2 ? t2->val : 0));
        currNode->left = mergeTrees((t1 ? t1->left : nullptr), (t2 ? t2->left : nullptr));
        currNode->right = mergeTrees((t1 ? t1->right : nullptr), (t2 ? t2->right : nullptr));
        
        return currNode;
    }
};