LeetCode617. 合并二叉树

题目

 1 class Solution {
 2 public:
 3     TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
 4         if(!t1 && !t2) return NULL;
 5         if(t1 == NULL&& t2 != NULL) return t2;
 6         if(t1 != NULL&& t2 == NULL) return t1;
 7         TreeNode* node = new TreeNode(t1->val + t2->val);;
 8         //指针赋值使用错误TreeNode* node; node->val = t1->val + t2->val;
 9         node->left = mergeTrees(t1->left,t2->left);
10         node->right = mergeTrees(t1->right,t2->right);
11         return node;
12     }
13 };

需要查看C++ primer, 复习指针使用