617-merge-two-binary-trees

DevGod
Vtuber
/** * Definition for a binary tree node. * function TreeNode(val, left, right) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? null : left) * this.right = (right===undefined ? null : right) * } *//** * @param {TreeNode} root1 * @param {TreeNode} root2 * @return {TreeNode} */var mergeTrees = function(root1, root2) { if(!root1 && !root2){ return null; }
let newNode = new TreeNode( (root1?.val|0) + (root2?.val|0) );
newNode.left = mergeTrees(root1?.left, root2?.left); newNode.right = mergeTrees(root1?.right, root2?.right);
return newNode;};