题解 | #合并二叉树#

/*
 * 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 === null) {
        return t2
    }
    if (t2 === null) {
        return t1
    }
    let head = new TreeNode(t1.val+t2.val)
    head.left = mergeTrees(t1.left, t2.left)
    head.right = mergeTrees(t1.right, t2.right)
    return head
}
module.exports = {
    mergeTrees : mergeTrees
};