621 合并二叉树

将两个二叉树合并，都为NULL返回NULL，缺一个返回剩下的那个
两个都有，就将值相加再返回合并那个
/**

• 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(t1NULL&&t2NULL)
  {
  return NULL;
  }
  else if(t1NULL&&t2!=NULL)
  {
  return t2;
  }
  else if(t1!=NULL&&t2NULL)
  {
  return t1;
  }
  else
  {
  t1->val+=t2->val;
  t1->left=mergeTrees(t1->left,t2->left);
  t1->right=mergeTrees(t1->right,t2->right);
  }
  return t1;
  }
  };