题解 | #合并二叉树#
合并二叉树
https://www.nowcoder.com/practice/7298353c24cc42e3bd5f0e0bd3d1d759
/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ /** * * @param t1 TreeNode类 * @param t2 TreeNode类 * @return TreeNode类 */ struct TreeNode* mergeTrees(struct TreeNode* t1, struct TreeNode* t2 ) { // 两树合并到t1树上 if(!t1&&!t2) return t1; if(!t1) return t2; if(!t2) return t1; t1->val += t2->val; // 递归 t1->left = mergeTrees(t1->left,t2->left); t1->right = mergeTrees(t1->right,t2->right); return t1; }