/*
* function TreeNode(x) {
* this.val = x;
* this.left = null;
* this.right = null;
* }
*/
/**
*
* @param t1 TreeNode类
* @param t2 TreeNode类
* @return TreeNode类
*/
function mergeTrees( t1 , t2 ) {
// write code here
if(!t1&&!t2) return null
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
}
module.exports = {
mergeTrees : mergeTrees
};
合并二叉树
最新推荐文章于 2022-04-19 22:34:01 发布