递归实现
合并二叉树
http://www.nowcoder.com/questionTerminal/7298353c24cc42e3bd5f0e0bd3d1d759
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
// write code here
if(t1 == nullptr || t2 == nullptr) return t1 == nullptr ? t2 : t1;
t1->val += t2->val;
t1->left = mergeTrees(t1->left, t2->left);
t1->right = mergeTrees(t1->right, t2->right);
return t1;
}
查看10道真题和解析
投递大连飞创信息技术有限公司等公司10个岗位