📚 16.合并二叉树
💻 代码实现
typescript
/**
* @url https://leetcode.cn/problems/merge-two-binary-trees/description/
*/
class TreeNode {
val: number
left: TreeNode | null
right: TreeNode | null
constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
this.val = val === undefined ? 0 : val
this.left = left === undefined ? null : left
this.right = right === undefined ? null : right
}
}
function mergeTrees(root1: TreeNode | null, root2: TreeNode | null): TreeNode | null {
if (!root1 && !root2) {
return null
}
if (!root1) return root2
if (!root2) return root1
root1.left = mergeTrees(root1.left, root2.left)
root1.right = mergeTrees(root1.right, root2.right)
root1.val += root2.val
return root1
}