617. Merge Two Binary Trees

class Solution {
public:
       int k = 0;
       bool vis(TreeNode* t1, TreeNode* t2) {
              if (k == 0 && t1 == NULL) {
                     return 2;
              }
              else {
                     k = 1;
              }
              if (t1 != NULL || t2 != NULL) {
                     if (t1 != NULL&&t2 != NULL) {
                           t1->val += t2->val;
                           bool flag1 = vis(t1->left, t2->left);
                           if (flag1)t1->left = t2->left;
                           bool flag2 = vis(t1->right, t2->right);
                           if (flag2)t1->right = t2->right;
                     }
                     else if (t1 == NULL) {
                           return 1;
                     }
                     else {
                           return 0;
                     }
              }
              return 0;
       }
       TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
              k = 0;
              if (vis(t1, t2))return t2;
              return t1;
       }
};